./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 00:12:16,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 00:12:16,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 00:12:16,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 00:12:16,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 00:12:16,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 00:12:16,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 00:12:16,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 00:12:16,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 00:12:16,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 00:12:16,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 00:12:16,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 00:12:16,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 00:12:16,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 00:12:16,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 00:12:16,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 00:12:16,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 00:12:16,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 00:12:16,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 00:12:16,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 00:12:16,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 00:12:16,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 00:12:16,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 00:12:16,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 00:12:16,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 00:12:16,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 00:12:16,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 00:12:16,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 00:12:16,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 00:12:16,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 00:12:16,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 00:12:16,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 00:12:16,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 00:12:16,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 00:12:16,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 00:12:16,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 00:12:16,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 00:12:16,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 00:12:16,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 00:12:16,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 00:12:16,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 00:12:16,807 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 00:12:16,841 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 00:12:16,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 00:12:16,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 00:12:16,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 00:12:16,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 00:12:16,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 00:12:16,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 00:12:16,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 00:12:16,844 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 00:12:16,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 00:12:16,845 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 00:12:16,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 00:12:16,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 00:12:16,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 00:12:16,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 00:12:16,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 00:12:16,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 00:12:16,846 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 00:12:16,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 00:12:16,847 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 00:12:16,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 00:12:16,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 00:12:16,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 00:12:16,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 00:12:16,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:12:16,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 00:12:16,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 00:12:16,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 00:12:16,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 00:12:16,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 00:12:16,850 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 00:12:16,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 00:12:16,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 00:12:16,851 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 00:12:16,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 [2021-12-16 00:12:17,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 00:12:17,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 00:12:17,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 00:12:17,056 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 00:12:17,057 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 00:12:17,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2021-12-16 00:12:17,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e0a621b3/42882bd0480b4564a36688d559aa4d4b/FLAG8aadb18c5 [2021-12-16 00:12:17,472 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 00:12:17,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2021-12-16 00:12:17,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e0a621b3/42882bd0480b4564a36688d559aa4d4b/FLAG8aadb18c5 [2021-12-16 00:12:17,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e0a621b3/42882bd0480b4564a36688d559aa4d4b [2021-12-16 00:12:17,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 00:12:17,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 00:12:17,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 00:12:17,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 00:12:17,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 00:12:17,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3328134b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17, skipping insertion in model container [2021-12-16 00:12:17,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 00:12:17,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 00:12:17,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2021-12-16 00:12:17,732 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-16 00:12:17,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:12:17,774 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 00:12:17,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2021-12-16 00:12:17,825 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-16 00:12:17,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:12:17,844 INFO L208 MainTranslator]: Completed translation [2021-12-16 00:12:17,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17 WrapperNode [2021-12-16 00:12:17,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 00:12:17,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 00:12:17,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 00:12:17,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 00:12:17,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,893 INFO L137 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2021-12-16 00:12:17,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 00:12:17,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 00:12:17,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 00:12:17,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 00:12:17,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 00:12:17,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 00:12:17,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 00:12:17,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 00:12:17,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (1/1) ... [2021-12-16 00:12:17,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:12:17,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:12:17,967 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) [2021-12-16 00:12:18,004 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 [2021-12-16 00:12:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 00:12:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 00:12:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 00:12:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 00:12:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-12-16 00:12:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-12-16 00:12:18,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 00:12:18,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-16 00:12:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-16 00:12:18,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 00:12:18,036 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-12-16 00:12:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-12-16 00:12:18,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 00:12:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 00:12:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-12-16 00:12:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-12-16 00:12:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 00:12:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 00:12:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 00:12:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 00:12:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-12-16 00:12:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-12-16 00:12:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 00:12:18,115 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 00:12:18,116 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 00:12:18,313 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 00:12:18,318 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 00:12:18,318 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 00:12:18,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:12:18 BoogieIcfgContainer [2021-12-16 00:12:18,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 00:12:18,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 00:12:18,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 00:12:18,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 00:12:18,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:12:17" (1/3) ... [2021-12-16 00:12:18,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b722a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:12:18, skipping insertion in model container [2021-12-16 00:12:18,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:12:17" (2/3) ... [2021-12-16 00:12:18,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b722a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:12:18, skipping insertion in model container [2021-12-16 00:12:18,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:12:18" (3/3) ... [2021-12-16 00:12:18,324 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2021-12-16 00:12:18,327 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 00:12:18,327 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 00:12:18,363 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 00:12:18,367 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=FAST_UPR [2021-12-16 00:12:18,368 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 00:12:18,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-16 00:12:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 00:12:18,391 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:18,392 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] [2021-12-16 00:12:18,393 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -858928279, now seen corresponding path program 1 times [2021-12-16 00:12:18,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:18,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997731584] [2021-12-16 00:12:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:18,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 00:12:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:12:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 00:12:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 00:12:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 00:12:18,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:12:18,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997731584] [2021-12-16 00:12:18,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997731584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:12:18,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:12:18,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 00:12:18,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89608349] [2021-12-16 00:12:18,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:12:18,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 00:12:18,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:12:18,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 00:12:18,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-16 00:12:18,669 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 00:12:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:12:18,837 INFO L93 Difference]: Finished difference Result 142 states and 192 transitions. [2021-12-16 00:12:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 00:12:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2021-12-16 00:12:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:12:18,850 INFO L225 Difference]: With dead ends: 142 [2021-12-16 00:12:18,850 INFO L226 Difference]: Without dead ends: 81 [2021-12-16 00:12:18,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-16 00:12:18,854 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 00:12:18,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 143 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 00:12:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-16 00:12:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2021-12-16 00:12:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-16 00:12:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2021-12-16 00:12:18,882 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 36 [2021-12-16 00:12:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:12:18,883 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2021-12-16 00:12:18,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 00:12:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2021-12-16 00:12:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 00:12:18,885 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:18,885 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] [2021-12-16 00:12:18,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 00:12:18,885 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:18,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1847691115, now seen corresponding path program 1 times [2021-12-16 00:12:18,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:18,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68515457] [2021-12-16 00:12:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:18,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 00:12:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:12:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 00:12:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 00:12:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 00:12:18,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:12:18,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68515457] [2021-12-16 00:12:18,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68515457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:12:18,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:12:18,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 00:12:18,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495720625] [2021-12-16 00:12:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:12:18,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 00:12:18,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:12:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 00:12:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 00:12:18,995 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 00:12:19,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:12:19,180 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2021-12-16 00:12:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 00:12:19,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2021-12-16 00:12:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:12:19,184 INFO L225 Difference]: With dead ends: 136 [2021-12-16 00:12:19,184 INFO L226 Difference]: Without dead ends: 83 [2021-12-16 00:12:19,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-16 00:12:19,187 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 78 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:12:19,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 296 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:12:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-16 00:12:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2021-12-16 00:12:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-16 00:12:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2021-12-16 00:12:19,208 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 36 [2021-12-16 00:12:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:12:19,208 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2021-12-16 00:12:19,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-16 00:12:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2021-12-16 00:12:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-16 00:12:19,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:19,211 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] [2021-12-16 00:12:19,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 00:12:19,212 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash 289307572, now seen corresponding path program 1 times [2021-12-16 00:12:19,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:19,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92074798] [2021-12-16 00:12:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:19,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 00:12:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:19,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 00:12:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:19,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:12:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 00:12:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 00:12:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 00:12:19,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:12:19,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92074798] [2021-12-16 00:12:19,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92074798] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 00:12:19,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938815670] [2021-12-16 00:12:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:19,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:12:19,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:12:19,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 00:12:19,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 00:12:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:19,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 00:12:19,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:12:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 00:12:19,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:12:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 00:12:19,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938815670] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:12:19,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 00:12:19,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2021-12-16 00:12:19,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827034370] [2021-12-16 00:12:19,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 00:12:19,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 00:12:19,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:12:19,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 00:12:19,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-16 00:12:19,852 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-16 00:12:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:12:20,143 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2021-12-16 00:12:20,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 00:12:20,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2021-12-16 00:12:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:12:20,145 INFO L225 Difference]: With dead ends: 142 [2021-12-16 00:12:20,145 INFO L226 Difference]: Without dead ends: 83 [2021-12-16 00:12:20,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-16 00:12:20,146 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 35 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:12:20,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 479 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:12:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-16 00:12:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2021-12-16 00:12:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2021-12-16 00:12:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2021-12-16 00:12:20,152 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 48 [2021-12-16 00:12:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:12:20,153 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2021-12-16 00:12:20,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-16 00:12:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2021-12-16 00:12:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 00:12:20,154 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:20,154 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] [2021-12-16 00:12:20,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-16 00:12:20,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:12:20,373 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1954582857, now seen corresponding path program 1 times [2021-12-16 00:12:20,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:20,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93872140] [2021-12-16 00:12:20,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:20,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:12:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 00:12:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 00:12:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 00:12:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:12:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 00:12:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 00:12:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-16 00:12:20,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:12:20,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93872140] [2021-12-16 00:12:20,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93872140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:12:20,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:12:20,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 00:12:20,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094557285] [2021-12-16 00:12:20,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:12:20,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 00:12:20,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:12:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 00:12:20,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:12:20,526 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 00:12:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:12:20,836 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2021-12-16 00:12:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 00:12:20,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2021-12-16 00:12:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:12:20,837 INFO L225 Difference]: With dead ends: 142 [2021-12-16 00:12:20,837 INFO L226 Difference]: Without dead ends: 85 [2021-12-16 00:12:20,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-16 00:12:20,839 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 107 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:12:20,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 427 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:12:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-16 00:12:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2021-12-16 00:12:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 55 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2021-12-16 00:12:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2021-12-16 00:12:20,845 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 58 [2021-12-16 00:12:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:12:20,846 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2021-12-16 00:12:20,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 00:12:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2021-12-16 00:12:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-16 00:12:20,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:20,847 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] [2021-12-16 00:12:20,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 00:12:20,848 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1575743044, now seen corresponding path program 1 times [2021-12-16 00:12:20,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:20,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672102187] [2021-12-16 00:12:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:20,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 00:12:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 00:12:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 00:12:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:12:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 00:12:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 00:12:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 00:12:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-16 00:12:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 00:12:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:12:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-16 00:12:20,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:12:20,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672102187] [2021-12-16 00:12:20,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672102187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:12:20,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:12:20,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 00:12:20,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847759575] [2021-12-16 00:12:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:12:20,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 00:12:20,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:12:20,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 00:12:20,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:12:20,995 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-16 00:12:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:12:21,235 INFO L93 Difference]: Finished difference Result 134 states and 175 transitions. [2021-12-16 00:12:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 00:12:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 71 [2021-12-16 00:12:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:12:21,236 INFO L225 Difference]: With dead ends: 134 [2021-12-16 00:12:21,236 INFO L226 Difference]: Without dead ends: 85 [2021-12-16 00:12:21,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-16 00:12:21,237 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 73 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:12:21,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 408 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 00:12:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-16 00:12:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2021-12-16 00:12:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2021-12-16 00:12:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2021-12-16 00:12:21,243 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 71 [2021-12-16 00:12:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:12:21,243 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2021-12-16 00:12:21,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-16 00:12:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2021-12-16 00:12:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 00:12:21,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:12:21,244 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] [2021-12-16 00:12:21,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 00:12:21,244 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:12:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:12:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1969188871, now seen corresponding path program 1 times [2021-12-16 00:12:21,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:12:21,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792348846] [2021-12-16 00:12:21,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:12:21,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:12:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 00:12:21,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 00:12:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 00:12:21,387 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 00:12:21,387 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 00:12:21,388 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 00:12:21,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 00:12:21,393 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-16 00:12:21,396 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 00:12:21,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:12:21 BoogieIcfgContainer [2021-12-16 00:12:21,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 00:12:21,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 00:12:21,452 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 00:12:21,452 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 00:12:21,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:12:18" (3/4) ... [2021-12-16 00:12:21,454 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 00:12:21,497 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 00:12:21,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 00:12:21,500 INFO L158 Benchmark]: Toolchain (without parser) took 3972.37ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 54.4MB in the beginning and 81.6MB in the end (delta: -27.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2021-12-16 00:12:21,500 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 44.2MB in the beginning and 44.2MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 00:12:21,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.49ms. Allocated memory is still 88.1MB. Free memory was 54.2MB in the beginning and 62.0MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 00:12:21,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.99ms. Allocated memory is still 88.1MB. Free memory was 62.0MB in the beginning and 60.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 00:12:21,501 INFO L158 Benchmark]: Boogie Preprocessor took 38.28ms. Allocated memory is still 88.1MB. Free memory was 60.0MB in the beginning and 58.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 00:12:21,501 INFO L158 Benchmark]: RCFGBuilder took 385.59ms. Allocated memory is still 88.1MB. Free memory was 57.9MB in the beginning and 40.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-16 00:12:21,502 INFO L158 Benchmark]: TraceAbstraction took 3131.51ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 40.5MB in the beginning and 85.8MB in the end (delta: -45.4MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2021-12-16 00:12:21,502 INFO L158 Benchmark]: Witness Printer took 47.36ms. Allocated memory is still 134.2MB. Free memory was 85.8MB in the beginning and 81.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 00:12:21,503 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.16ms. Allocated memory is still 88.1MB. Free memory was 44.2MB in the beginning and 44.2MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.49ms. Allocated memory is still 88.1MB. Free memory was 54.2MB in the beginning and 62.0MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.99ms. Allocated memory is still 88.1MB. Free memory was 62.0MB in the beginning and 60.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.28ms. Allocated memory is still 88.1MB. Free memory was 60.0MB in the beginning and 58.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.59ms. Allocated memory is still 88.1MB. Free memory was 57.9MB in the beginning and 40.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3131.51ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 40.5MB in the beginning and 85.8MB in the end (delta: -45.4MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Witness Printer took 47.36ms. Allocated memory is still 134.2MB. Free memory was 85.8MB in the beginning and 81.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-2:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}, n={-2:0}] [L105] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) VAL [n={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-2:0}, n={-2:0}, n->left={0:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-2:0}, n={-2:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-2:0}, n={-2:0}] [L83] RET, EXPR min(t) VAL [min(t)=2147483647, t={-2:0}, t={-2:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={5:0}, t={-2:0}, t={-2:0}] [L86] CALL, EXPR size(t) VAL [t={-2:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L79] CALL, EXPR size(t->left) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L79] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] CALL, EXPR size(t->right) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-2:0}, t={-2:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}] [L88] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}] [L89] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, tree_inorder(t, x, n)=2, x={-3:0}] [L90] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-3:0}, n=1, t={-2:0}, t={-2:0}, x={-3:0}, x[0]=0] [L90] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 1753 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1339 mSDsCounter, 276 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1111 IncrementalHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 276 mSolverCounterUnsat, 414 mSDtfsCounter, 1111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, InterpolantAutomatonStates: 36, 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, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 338 ConstructedInterpolants, 0 QuantifiedInterpolants, 959 SizeOfPredicates, 6 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 84/90 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-16 00:12:21,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE