./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-17 15:28:48,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 15:28:48,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 15:28:48,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 15:28:48,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 15:28:48,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 15:28:48,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 15:28:48,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 15:28:48,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 15:28:48,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 15:28:48,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 15:28:48,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 15:28:48,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 15:28:48,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 15:28:48,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 15:28:48,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 15:28:48,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 15:28:48,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 15:28:48,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 15:28:48,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 15:28:48,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 15:28:48,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 15:28:48,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 15:28:48,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 15:28:48,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 15:28:48,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 15:28:48,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 15:28:48,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 15:28:48,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 15:28:48,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 15:28:48,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 15:28:48,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 15:28:48,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 15:28:48,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 15:28:48,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 15:28:48,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 15:28:48,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 15:28:48,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 15:28:48,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 15:28:48,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 15:28:48,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 15:28:48,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 15:28:48,664 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 15:28:48,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 15:28:48,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 15:28:48,665 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 15:28:48,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 15:28:48,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 15:28:48,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 15:28:48,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 15:28:48,667 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 15:28:48,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 15:28:48,667 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 15:28:48,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 15:28:48,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 15:28:48,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 15:28:48,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 15:28:48,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 15:28:48,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 15:28:48,669 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 15:28:48,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 15:28:48,669 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 15:28:48,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 15:28:48,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 15:28:48,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 15:28:48,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 15:28:48,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:28:48,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 15:28:48,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 15:28:48,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 15:28:48,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 15:28:48,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 15:28:48,672 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 15:28:48,672 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 15:28:48,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 15:28:48,673 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 15:28:48,673 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-17 15:28:48,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 15:28:48,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 15:28:48,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 15:28:48,926 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 15:28:48,927 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 15:28:48,928 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-17 15:28:48,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2374dfb97/cc1f9a650d434aab9f01e52d320fda05/FLAG55c3d31ee [2021-12-17 15:28:49,448 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 15:28:49,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2021-12-17 15:28:49,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2374dfb97/cc1f9a650d434aab9f01e52d320fda05/FLAG55c3d31ee [2021-12-17 15:28:49,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2374dfb97/cc1f9a650d434aab9f01e52d320fda05 [2021-12-17 15:28:49,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 15:28:49,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 15:28:49,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 15:28:49,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 15:28:49,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 15:28:49,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db08736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49, skipping insertion in model container [2021-12-17 15:28:49,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 15:28:49,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 15:28:49,656 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-17 15:28:49,666 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-17 15:28:49,669 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-17 15:28:49,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:28:49,706 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 15:28:49,716 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-17 15:28:49,720 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-17 15:28:49,721 WARN L1533 CHandler]: Possible shadowing of function min [2021-12-17 15:28:49,729 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:28:49,742 INFO L208 MainTranslator]: Completed translation [2021-12-17 15:28:49,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49 WrapperNode [2021-12-17 15:28:49,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 15:28:49,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 15:28:49,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 15:28:49,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 15:28:49,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,789 INFO L137 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2021-12-17 15:28:49,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 15:28:49,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 15:28:49,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 15:28:49,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 15:28:49,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 15:28:49,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 15:28:49,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 15:28:49,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 15:28:49,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (1/1) ... [2021-12-17 15:28:49,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:28:49,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:28:49,862 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-17 15:28:49,874 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-17 15:28:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 15:28:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 15:28:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 15:28:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2021-12-17 15:28:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2021-12-17 15:28:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 15:28:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-12-17 15:28:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-12-17 15:28:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 15:28:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-17 15:28:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-17 15:28:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 15:28:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-12-17 15:28:49,901 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-12-17 15:28:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 15:28:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 15:28:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-12-17 15:28:49,901 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-12-17 15:28:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 15:28:49,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 15:28:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 15:28:49,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 15:28:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-12-17 15:28:49,902 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-12-17 15:28:49,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 15:28:50,038 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 15:28:50,039 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 15:28:50,390 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 15:28:50,396 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 15:28:50,398 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 15:28:50,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:28:50 BoogieIcfgContainer [2021-12-17 15:28:50,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 15:28:50,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 15:28:50,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 15:28:50,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 15:28:50,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 03:28:49" (1/3) ... [2021-12-17 15:28:50,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f418fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:28:50, skipping insertion in model container [2021-12-17 15:28:50,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:28:49" (2/3) ... [2021-12-17 15:28:50,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f418fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:28:50, skipping insertion in model container [2021-12-17 15:28:50,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:28:50" (3/3) ... [2021-12-17 15:28:50,411 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2021-12-17 15:28:50,416 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 15:28:50,416 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 15:28:50,476 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 15:28:50,491 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-17 15:28:50,491 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 15:28:50,512 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-17 15:28:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 15:28:50,521 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:50,522 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-17 15:28:50,523 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:50,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1201346449, now seen corresponding path program 1 times [2021-12-17 15:28:50,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:50,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59847958] [2021-12-17 15:28:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:50,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:50,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 15:28:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:28:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:50,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 15:28:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:50,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-17 15:28:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:50,854 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-17 15:28:50,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:28:50,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59847958] [2021-12-17 15:28:50,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59847958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:28:50,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:28:50,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 15:28:50,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31981016] [2021-12-17 15:28:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:28:50,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:28:50,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:28:50,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:28:50,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-17 15:28:50,890 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-17 15:28:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:28:51,139 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2021-12-17 15:28:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:28:51,142 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-17 15:28:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:28:51,150 INFO L225 Difference]: With dead ends: 148 [2021-12-17 15:28:51,150 INFO L226 Difference]: Without dead ends: 84 [2021-12-17 15:28:51,153 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-17 15:28:51,156 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.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:28:51,157 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.2s Time] [2021-12-17 15:28:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-17 15:28:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2021-12-17 15:28:51,192 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-17 15:28:51,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2021-12-17 15:28:51,195 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 36 [2021-12-17 15:28:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:28:51,196 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2021-12-17 15:28:51,196 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-17 15:28:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2021-12-17 15:28:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 15:28:51,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:51,199 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-17 15:28:51,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 15:28:51,199 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1505272945, now seen corresponding path program 1 times [2021-12-17 15:28:51,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:51,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842219283] [2021-12-17 15:28:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:51,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 15:28:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:28:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-17 15:28:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-17 15:28:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,358 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-17 15:28:51,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:28:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842219283] [2021-12-17 15:28:51,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842219283] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:28:51,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:28:51,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-17 15:28:51,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522930849] [2021-12-17 15:28:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:28:51,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 15:28:51,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:28:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 15:28:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:28:51,363 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-17 15:28:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:28:51,569 INFO L93 Difference]: Finished difference Result 142 states and 184 transitions. [2021-12-17 15:28:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:28:51,570 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-17 15:28:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:28:51,572 INFO L225 Difference]: With dead ends: 142 [2021-12-17 15:28:51,572 INFO L226 Difference]: Without dead ends: 86 [2021-12-17 15:28:51,573 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-17 15:28:51,575 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-17 15:28:51,575 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-17 15:28:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-17 15:28:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2021-12-17 15:28:51,585 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-17 15:28:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2021-12-17 15:28:51,587 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 36 [2021-12-17 15:28:51,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:28:51,587 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2021-12-17 15:28:51,587 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-17 15:28:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2021-12-17 15:28:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 15:28:51,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:51,590 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-17 15:28:51,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 15:28:51,590 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:51,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1392403970, now seen corresponding path program 1 times [2021-12-17 15:28:51,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:51,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341522971] [2021-12-17 15:28:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:51,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-17 15:28:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 15:28:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 15:28:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 15:28:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-17 15:28:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,782 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-17 15:28:51,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:28:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341522971] [2021-12-17 15:28:51,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341522971] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:28:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649885376] [2021-12-17 15:28:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:51,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:28:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:28:51,786 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-17 15:28:51,796 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-17 15:28:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:51,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-17 15:28:51,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:28:52,212 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-17 15:28:52,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 15:28:52,488 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-17 15:28:52,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649885376] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 15:28:52,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 15:28:52,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2021-12-17 15:28:52,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564677582] [2021-12-17 15:28:52,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 15:28:52,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 15:28:52,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:28:52,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 15:28:52,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:28:52,491 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-17 15:28:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:28:52,857 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2021-12-17 15:28:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 15:28:52,859 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-17 15:28:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:28:52,865 INFO L225 Difference]: With dead ends: 148 [2021-12-17 15:28:52,865 INFO L226 Difference]: Without dead ends: 86 [2021-12-17 15:28:52,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-12-17 15:28:52,870 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-17 15:28:52,875 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-17 15:28:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-17 15:28:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2021-12-17 15:28:52,888 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-17 15:28:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2021-12-17 15:28:52,889 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 48 [2021-12-17 15:28:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:28:52,889 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2021-12-17 15:28:52,890 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-17 15:28:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2021-12-17 15:28:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 15:28:52,891 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:52,891 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-17 15:28:52,918 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-17 15:28:53,092 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-17 15:28:53,092 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash 164705413, now seen corresponding path program 1 times [2021-12-17 15:28:53,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:53,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616222686] [2021-12-17 15:28:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:53,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 15:28:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:28:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:28:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-17 15:28:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 15:28:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 15:28:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-17 15:28:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,252 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-17 15:28:53,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:28:53,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616222686] [2021-12-17 15:28:53,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616222686] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:28:53,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:28:53,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 15:28:53,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373720358] [2021-12-17 15:28:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:28:53,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 15:28:53,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:28:53,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 15:28:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:28:53,258 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-17 15:28:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:28:53,601 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2021-12-17 15:28:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 15:28:53,601 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-17 15:28:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:28:53,603 INFO L225 Difference]: With dead ends: 148 [2021-12-17 15:28:53,603 INFO L226 Difference]: Without dead ends: 88 [2021-12-17 15:28:53,603 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-17 15:28:53,604 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.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:28:53,604 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.3s Time] [2021-12-17 15:28:53,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-17 15:28:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2021-12-17 15:28:53,622 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-17 15:28:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2021-12-17 15:28:53,623 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 58 [2021-12-17 15:28:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:28:53,624 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2021-12-17 15:28:53,624 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-17 15:28:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2021-12-17 15:28:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-17 15:28:53,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:53,626 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-17 15:28:53,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 15:28:53,626 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash 159940150, now seen corresponding path program 1 times [2021-12-17 15:28:53,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:53,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66605999] [2021-12-17 15:28:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:53,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-17 15:28:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-17 15:28:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:28:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 15:28:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-17 15:28:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 15:28:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-17 15:28:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 15:28:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-17 15:28:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:28:53,820 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-17 15:28:53,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:28:53,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66605999] [2021-12-17 15:28:53,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66605999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:28:53,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:28:53,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 15:28:53,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303438191] [2021-12-17 15:28:53,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:28:53,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 15:28:53,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:28:53,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 15:28:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:28:53,823 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-17 15:28:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:28:54,110 INFO L93 Difference]: Finished difference Result 140 states and 181 transitions. [2021-12-17 15:28:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:28:54,110 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-17 15:28:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:28:54,112 INFO L225 Difference]: With dead ends: 140 [2021-12-17 15:28:54,112 INFO L226 Difference]: Without dead ends: 88 [2021-12-17 15:28:54,112 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-17 15:28:54,113 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 90 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-17 15:28:54,113 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-17 15:28:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-17 15:28:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2021-12-17 15:28:54,120 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-17 15:28:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2021-12-17 15:28:54,122 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 71 [2021-12-17 15:28:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:28:54,122 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2021-12-17 15:28:54,122 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-17 15:28:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2021-12-17 15:28:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-17 15:28:54,125 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:28:54,125 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-17 15:28:54,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 15:28:54,125 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:28:54,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:28:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash 661772809, now seen corresponding path program 1 times [2021-12-17 15:28:54,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:28:54,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836857677] [2021-12-17 15:28:54,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:28:54,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:28:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:28:54,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 15:28:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 15:28:54,206 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 15:28:54,206 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 15:28:54,207 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 15:28:54,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 15:28:54,211 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-12-17 15:28:54,214 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 15:28:54,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 03:28:54 BoogieIcfgContainer [2021-12-17 15:28:54,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 15:28:54,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 15:28:54,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 15:28:54,255 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 15:28:54,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:28:50" (3/4) ... [2021-12-17 15:28:54,256 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 15:28:54,296 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 15:28:54,299 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 15:28:54,299 INFO L158 Benchmark]: Toolchain (without parser) took 4820.21ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 96.5MB in the beginning and 68.9MB in the end (delta: 27.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2021-12-17 15:28:54,300 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory was 37.3MB in the beginning and 37.3MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:28:54,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.07ms. Allocated memory is still 127.9MB. Free memory was 96.2MB in the beginning and 100.9MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 15:28:54,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.01ms. Allocated memory is still 127.9MB. Free memory was 100.9MB in the beginning and 99.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:28:54,301 INFO L158 Benchmark]: Boogie Preprocessor took 32.89ms. Allocated memory is still 127.9MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:28:54,301 INFO L158 Benchmark]: RCFGBuilder took 577.40ms. Allocated memory is still 127.9MB. Free memory was 97.4MB in the beginning and 80.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-17 15:28:54,301 INFO L158 Benchmark]: TraceAbstraction took 3850.83ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 79.9MB in the beginning and 74.2MB in the end (delta: 5.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2021-12-17 15:28:54,302 INFO L158 Benchmark]: Witness Printer took 44.76ms. Allocated memory is still 157.3MB. Free memory was 74.2MB in the beginning and 68.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 15:28:54,303 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.20ms. Allocated memory is still 79.7MB. Free memory was 37.3MB in the beginning and 37.3MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.07ms. Allocated memory is still 127.9MB. Free memory was 96.2MB in the beginning and 100.9MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.01ms. Allocated memory is still 127.9MB. Free memory was 100.9MB in the beginning and 99.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.89ms. Allocated memory is still 127.9MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 577.40ms. Allocated memory is still 127.9MB. Free memory was 97.4MB in the beginning and 80.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3850.83ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 79.9MB in the beginning and 74.2MB in the end (delta: 5.7MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 44.76ms. Allocated memory is still 157.3MB. Free memory was 74.2MB in the beginning and 68.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 1795 SdHoareTripleChecker+Invalid, 0.9s 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.4s 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.4s 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-17 15:28:54,344 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