./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec_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_rec_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 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 01:05:27,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 01:05:27,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 01:05:27,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 01:05:27,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 01:05:27,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 01:05:27,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 01:05:27,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 01:05:27,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 01:05:27,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 01:05:27,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 01:05:27,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 01:05:27,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 01:05:27,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 01:05:27,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 01:05:27,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 01:05:27,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 01:05:27,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 01:05:27,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 01:05:27,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 01:05:27,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 01:05:27,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 01:05:27,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 01:05:27,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 01:05:27,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 01:05:27,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 01:05:27,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 01:05:27,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 01:05:27,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 01:05:27,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 01:05:27,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 01:05:27,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 01:05:27,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 01:05:27,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 01:05:27,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 01:05:27,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 01:05:27,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 01:05:27,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 01:05:27,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 01:05:27,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 01:05:27,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 01:05:27,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 01:05:27,733 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 01:05:27,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 01:05:27,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 01:05:27,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 01:05:27,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 01:05:27,734 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 01:05:27,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 01:05:27,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 01:05:27,735 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 01:05:27,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 01:05:27,735 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 01:05:27,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 01:05:27,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 01:05:27,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 01:05:27,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 01:05:27,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 01:05:27,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 01:05:27,737 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 01:05:27,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 01:05:27,737 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 01:05:27,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 01:05:27,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 01:05:27,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 01:05:27,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 01:05:27,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:05:27,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 01:05:27,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 01:05:27,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 01:05:27,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 01:05:27,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 01:05:27,739 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 01:05:27,739 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 01:05:27,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 01:05:27,739 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 01:05:27,739 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 -> 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 [2021-12-16 01:05:27,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 01:05:27,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 01:05:27,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 01:05:27,955 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 01:05:27,955 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 01:05:27,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2021-12-16 01:05:28,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f2c7a9e/11b36fca683348e3bb03abf3be1f4529/FLAGee498e1ad [2021-12-16 01:05:28,419 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 01:05:28,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2021-12-16 01:05:28,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f2c7a9e/11b36fca683348e3bb03abf3be1f4529/FLAGee498e1ad [2021-12-16 01:05:28,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f2c7a9e/11b36fca683348e3bb03abf3be1f4529 [2021-12-16 01:05:28,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 01:05:28,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 01:05:28,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 01:05:28,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 01:05:28,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 01:05:28,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:05:28" (1/1) ... [2021-12-16 01:05:28,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606a6dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:28, skipping insertion in model container [2021-12-16 01:05:28,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:05:28" (1/1) ... [2021-12-16 01:05:28,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 01:05:28,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 01:05:28,967 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_rec_incorrect.c[618,631] [2021-12-16 01:05:28,990 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-16 01:05:28,993 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-16 01:05:29,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:05:29,016 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 01:05:29,024 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_rec_incorrect.c[618,631] [2021-12-16 01:05:29,026 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-16 01:05:29,027 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-16 01:05:29,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:05:29,042 INFO L208 MainTranslator]: Completed translation [2021-12-16 01:05:29,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29 WrapperNode [2021-12-16 01:05:29,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 01:05:29,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 01:05:29,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 01:05:29,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 01:05:29,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,066 INFO L137 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2021-12-16 01:05:29,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 01:05:29,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 01:05:29,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 01:05:29,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 01:05:29,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 01:05:29,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 01:05:29,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 01:05:29,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 01:05:29,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (1/1) ... [2021-12-16 01:05:29,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:05:29,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:05:29,108 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 01:05:29,110 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 01:05:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 01:05:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 01:05:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 01:05:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2021-12-16 01:05:29,146 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2021-12-16 01:05:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 01:05:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-12-16 01:05:29,147 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-12-16 01:05:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 01:05:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-16 01:05:29,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-16 01:05:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 01:05:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-12-16 01:05:29,147 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-12-16 01:05:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 01:05:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 01:05:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-12-16 01:05:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-12-16 01:05:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 01:05:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 01:05:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 01:05:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 01:05:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-12-16 01:05:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-12-16 01:05:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 01:05:29,269 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 01:05:29,270 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 01:05:29,465 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 01:05:29,470 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 01:05:29,471 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 01:05:29,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:05:29 BoogieIcfgContainer [2021-12-16 01:05:29,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 01:05:29,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 01:05:29,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 01:05:29,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 01:05:29,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:05:28" (1/3) ... [2021-12-16 01:05:29,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb60cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:05:29, skipping insertion in model container [2021-12-16 01:05:29,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:05:29" (2/3) ... [2021-12-16 01:05:29,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb60cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:05:29, skipping insertion in model container [2021-12-16 01:05:29,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:05:29" (3/3) ... [2021-12-16 01:05:29,480 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2021-12-16 01:05:29,483 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 01:05:29,483 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 01:05:29,523 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 01:05:29,527 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 01:05:29,528 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 01:05:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-16 01:05:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:05:29,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:05:29,543 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 01:05:29,544 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:05:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:05:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1201346449, now seen corresponding path program 1 times [2021-12-16 01:05:29,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:05:29,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800597435] [2021-12-16 01:05:29,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:05:29,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:05:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:29,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:05:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:29,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 01:05:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 01:05:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 01:05:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 01:05:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:29,781 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 01:05:29,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:05:29,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800597435] [2021-12-16 01:05:29,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800597435] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:05:29,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:05:29,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 01:05:29,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504262979] [2021-12-16 01:05:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:05:29,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:05:29,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:05:29,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:05:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:05:29,810 INFO L87 Difference]: Start difference. First operand has 84 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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 01:05:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:05:29,993 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2021-12-16 01:05:29,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:05:29,995 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 01:05:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:05:30,007 INFO L225 Difference]: With dead ends: 148 [2021-12-16 01:05:30,007 INFO L226 Difference]: Without dead ends: 84 [2021-12-16 01:05:30,011 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 01:05:30,015 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 27 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 01:05:30,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:05:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-16 01:05:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2021-12-16 01:05:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-16 01:05:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2021-12-16 01:05:30,064 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 36 [2021-12-16 01:05:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:05:30,067 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2021-12-16 01:05:30,067 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 01:05:30,068 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2021-12-16 01:05:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-16 01:05:30,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:05:30,071 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 01:05:30,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 01:05:30,072 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:05:30,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:05:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1505272945, now seen corresponding path program 1 times [2021-12-16 01:05:30,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:05:30,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201074596] [2021-12-16 01:05:30,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:05:30,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:05:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:05:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 01:05:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 01:05:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-16 01:05:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-16 01:05:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,289 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 01:05:30,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:05:30,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201074596] [2021-12-16 01:05:30,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201074596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:05:30,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:05:30,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 01:05:30,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539109057] [2021-12-16 01:05:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:05:30,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 01:05:30,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:05:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 01:05:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-16 01:05:30,292 INFO L87 Difference]: Start difference. First operand 79 states and 100 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 01:05:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:05:30,519 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2021-12-16 01:05:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:05:30,520 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 01:05:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:05:30,524 INFO L225 Difference]: With dead ends: 142 [2021-12-16 01:05:30,524 INFO L226 Difference]: Without dead ends: 86 [2021-12-16 01:05:30,527 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 01:05:30,528 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 28 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:05:30,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 310 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:05:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-16 01:05:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2021-12-16 01:05:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.14) internal successors, (57), 51 states have internal predecessors, (57), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2021-12-16 01:05:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2021-12-16 01:05:30,552 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 36 [2021-12-16 01:05:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:05:30,552 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2021-12-16 01:05:30,553 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 01:05:30,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2021-12-16 01:05:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-16 01:05:30,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:05:30,559 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 01:05:30,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 01:05:30,561 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:05:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:05:30,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1392403970, now seen corresponding path program 1 times [2021-12-16 01:05:30,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:05:30,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416183756] [2021-12-16 01:05:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:05:30,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:05:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:05:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 01:05:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 01:05:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:05:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 01:05:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-16 01:05:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-16 01:05:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,700 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 01:05:30,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:05:30,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416183756] [2021-12-16 01:05:30,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416183756] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:05:30,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044460797] [2021-12-16 01:05:30,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:05:30,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:05:30,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:05:30,727 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 01:05:30,747 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 01:05:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:30,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 01:05:30,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:05:31,109 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 01:05:31,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 01:05:31,292 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 01:05:31,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044460797] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 01:05:31,292 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 01:05:31,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2021-12-16 01:05:31,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143370031] [2021-12-16 01:05:31,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 01:05:31,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 01:05:31,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:05:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 01:05:31,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:05:31,294 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 01:05:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:05:31,625 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2021-12-16 01:05:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 01:05:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 48 [2021-12-16 01:05:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:05:31,627 INFO L225 Difference]: With dead ends: 148 [2021-12-16 01:05:31,627 INFO L226 Difference]: Without dead ends: 86 [2021-12-16 01:05:31,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-12-16 01:05:31,628 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 34 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:05:31,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 480 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:05:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-16 01:05:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2021-12-16 01:05:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-16 01:05:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2021-12-16 01:05:31,635 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 48 [2021-12-16 01:05:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:05:31,635 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2021-12-16 01:05:31,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-16 01:05:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2021-12-16 01:05:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-16 01:05:31,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:05:31,636 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 01:05:31,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 01:05:31,850 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 01:05:31,850 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:05:31,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:05:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash 164705413, now seen corresponding path program 1 times [2021-12-16 01:05:31,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:05:31,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221395954] [2021-12-16 01:05:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:05:31,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:05:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:05:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:05:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 01:05:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:05:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-16 01:05:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:05:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 01:05:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-16 01:05:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-16 01:05:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:31,976 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 01:05:31,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:05:31,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221395954] [2021-12-16 01:05:31,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221395954] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:05:31,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:05:31,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 01:05:31,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419486996] [2021-12-16 01:05:31,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:05:31,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 01:05:31,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:05:31,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 01:05:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:05:31,991 INFO L87 Difference]: Start difference. First operand 83 states and 107 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 01:05:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:05:32,251 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2021-12-16 01:05:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 01:05:32,252 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 01:05:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:05:32,252 INFO L225 Difference]: With dead ends: 148 [2021-12-16 01:05:32,253 INFO L226 Difference]: Without dead ends: 88 [2021-12-16 01:05:32,253 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 01:05:32,254 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 71 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:05:32,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 462 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:05:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-16 01:05:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2021-12-16 01:05:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2021-12-16 01:05:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2021-12-16 01:05:32,260 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 58 [2021-12-16 01:05:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:05:32,260 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2021-12-16 01:05:32,261 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 01:05:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2021-12-16 01:05:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-16 01:05:32,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:05:32,262 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 01:05:32,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 01:05:32,262 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:05:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:05:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash 159940150, now seen corresponding path program 1 times [2021-12-16 01:05:32,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:05:32,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543313257] [2021-12-16 01:05:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:05:32,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:05:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:05:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-16 01:05:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-16 01:05:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-16 01:05:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:05:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 01:05:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-16 01:05:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 01:05:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-16 01:05:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-16 01:05:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-16 01:05:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:05:32,362 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 01:05:32,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:05:32,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543313257] [2021-12-16 01:05:32,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543313257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:05:32,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:05:32,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 01:05:32,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721908668] [2021-12-16 01:05:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:05:32,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 01:05:32,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:05:32,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 01:05:32,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:05:32,364 INFO L87 Difference]: Start difference. First operand 85 states and 110 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 01:05:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:05:32,575 INFO L93 Difference]: Finished difference Result 140 states and 181 transitions. [2021-12-16 01:05:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:05:32,576 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 01:05:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:05:32,577 INFO L225 Difference]: With dead ends: 140 [2021-12-16 01:05:32,577 INFO L226 Difference]: Without dead ends: 88 [2021-12-16 01:05:32,577 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 01:05:32,578 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 90 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:05:32,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 406 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:05:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-16 01:05:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2021-12-16 01:05:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 57 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2021-12-16 01:05:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2021-12-16 01:05:32,583 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 71 [2021-12-16 01:05:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:05:32,584 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2021-12-16 01:05:32,584 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 01:05:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2021-12-16 01:05:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 01:05:32,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:05:32,585 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 01:05:32,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 01:05:32,585 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:05:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:05:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash 661772809, now seen corresponding path program 1 times [2021-12-16 01:05:32,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:05:32,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120734330] [2021-12-16 01:05:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:05:32,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:05:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:05:32,619 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 01:05:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:05:32,679 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 01:05:32,680 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 01:05:32,680 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 01:05:32,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 01:05:32,693 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-16 01:05:32,695 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 01:05:32,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:05:32 BoogieIcfgContainer [2021-12-16 01:05:32,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 01:05:32,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 01:05:32,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 01:05:32,745 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 01:05:32,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:05:29" (3/4) ... [2021-12-16 01:05:32,746 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 01:05:32,793 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 01:05:32,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 01:05:32,793 INFO L158 Benchmark]: Toolchain (without parser) took 3981.52ms. Allocated memory was 88.1MB in the beginning and 148.9MB in the end (delta: 60.8MB). Free memory was 46.7MB in the beginning and 111.7MB in the end (delta: -65.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:05:32,793 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:05:32,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.82ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 46.5MB in the beginning and 80.4MB in the end (delta: -33.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 01:05:32,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.88ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 79.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:05:32,794 INFO L158 Benchmark]: Boogie Preprocessor took 20.17ms. Allocated memory is still 109.1MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:05:32,794 INFO L158 Benchmark]: RCFGBuilder took 384.28ms. Allocated memory is still 109.1MB. Free memory was 77.0MB in the beginning and 74.4MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 01:05:32,795 INFO L158 Benchmark]: TraceAbstraction took 3271.32ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 74.4MB in the beginning and 115.9MB in the end (delta: -41.5MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2021-12-16 01:05:32,795 INFO L158 Benchmark]: Witness Printer took 48.31ms. Allocated memory is still 148.9MB. Free memory was 115.9MB in the beginning and 111.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 01:05:32,796 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 63.7MB in the beginning and 63.6MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.82ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 46.5MB in the beginning and 80.4MB in the end (delta: -33.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.88ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 79.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.17ms. Allocated memory is still 109.1MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.28ms. Allocated memory is still 109.1MB. Free memory was 77.0MB in the beginning and 74.4MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3271.32ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 74.4MB in the beginning and 115.9MB in the end (delta: -41.5MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * Witness Printer took 48.31ms. Allocated memory is still 148.9MB. Free memory was 115.9MB in the beginning and 111.7MB 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: [L98] 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}] [L98] RET, EXPR nondet_tree() VAL [nondet_tree()={-2:0}] [L98] CALL task(nondet_tree()) [L76] 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}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={-2:0}, t={-2:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-2:0}, t={-2:0}] [L79] CALL, EXPR size(t) VAL [t={-2:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] 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}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-2:0}, t={-2:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_abort_if_not(n != 0) [L81] 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}] [L81] 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}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L60] COND FALSE !(!t) [L63] 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}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L63] 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] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] 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}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L65] 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] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L82] 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}] [L83] 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] [L83] 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 8 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, 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, 270 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 1795 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1379 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1207 IncrementalHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 416 mSDtfsCounter, 1207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 338 ConstructedInterpolants, 0 QuantifiedInterpolants, 947 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 01:05:32,826 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... --- 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