./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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 --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.3.0-?-798a7b3-m [2025-03-03 14:41:55,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:41:55,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:41:55,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:41:55,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:41:55,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:41:55,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:41:55,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:41:55,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:41:55,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:41:55,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:41:55,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:41:55,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:41:55,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:41:55,767 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:41:55,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:41:55,768 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:41:55,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:41:55,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:41:55,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:41:55,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:41:55,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:41:55,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:41:55,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:41:55,769 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:41:55,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:41:55,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:41:55,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:41:55,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:41:55,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:41:55,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:41:55,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:41:55,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 [2025-03-03 14:41:55,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:41:55,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:41:55,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:41:55,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:41:55,982 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:41:55,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2025-03-03 14:41:57,073 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4997b02cd/fcbae5b5887641bf86b4069b83aac1b6/FLAG5ff9f5652 [2025-03-03 14:41:57,305 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:41:57,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2025-03-03 14:41:57,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4997b02cd/fcbae5b5887641bf86b4069b83aac1b6/FLAG5ff9f5652 [2025-03-03 14:41:57,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4997b02cd/fcbae5b5887641bf86b4069b83aac1b6 [2025-03-03 14:41:57,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:41:57,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:41:57,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:41:57,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:41:57,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:41:57,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae78835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57, skipping insertion in model container [2025-03-03 14:41:57,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:41:57,749 WARN L250 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] [2025-03-03 14:41:57,763 WARN L1731 CHandler]: Possible shadowing of function min [2025-03-03 14:41:57,763 WARN L1731 CHandler]: Possible shadowing of function min [2025-03-03 14:41:57,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:41:57,789 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:41:57,796 WARN L250 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] [2025-03-03 14:41:57,801 WARN L1731 CHandler]: Possible shadowing of function min [2025-03-03 14:41:57,803 WARN L1731 CHandler]: Possible shadowing of function min [2025-03-03 14:41:57,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:41:57,827 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:41:57,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57 WrapperNode [2025-03-03 14:41:57,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:41:57,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:41:57,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:41:57,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:41:57,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,856 INFO L138 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-03 14:41:57,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:41:57,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:41:57,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:41:57,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:41:57,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,891 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [5, 2, 2, 15]. 63 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0]. The 7 writes are split as follows [2, 0, 1, 4]. [2025-03-03 14:41:57,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,900 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:41:57,909 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:41:57,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:41:57,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:41:57,910 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (1/1) ... [2025-03-03 14:41:57,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:41:57,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:41:57,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:41:57,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:41:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:41:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:41:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 14:41:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 14:41:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 14:41:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 14:41:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2025-03-03 14:41:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure min [2025-03-03 14:41:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-03 14:41:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2025-03-03 14:41:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure size [2025-03-03 14:41:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:41:57,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:41:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 14:41:57,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 14:41:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2025-03-03 14:41:57,951 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2025-03-03 14:41:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:41:58,058 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:41:58,060 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:41:58,127 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L39: havoc ~a~0, ~b~0; [2025-03-03 14:41:58,144 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc ~n~0.base, ~n~0.offset; [2025-03-03 14:41:58,277 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-03 14:41:58,278 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:41:58,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:41:58,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:41:58,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:41:58 BoogieIcfgContainer [2025-03-03 14:41:58,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:41:58,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:41:58,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:41:58,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:41:58,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:41:57" (1/3) ... [2025-03-03 14:41:58,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da0530c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:41:58, skipping insertion in model container [2025-03-03 14:41:58,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:41:57" (2/3) ... [2025-03-03 14:41:58,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da0530c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:41:58, skipping insertion in model container [2025-03-03 14:41:58,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:41:58" (3/3) ... [2025-03-03 14:41:58,293 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2025-03-03 14:41:58,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:41:58,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_del_rec_incorrect.c that has 8 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:41:58,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:41:58,350 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24ec0db4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:41:58,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:41:58,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 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) [2025-03-03 14:41:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:41:58,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:41:58,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:41:58,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:41:58,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:41:58,361 INFO L85 PathProgramCache]: Analyzing trace with hash 721216214, now seen corresponding path program 1 times [2025-03-03 14:41:58,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:41:58,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952024749] [2025-03-03 14:41:58,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:41:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:41:58,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:41:58,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:41:58,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:41:58,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:41:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:41:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:41:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952024749] [2025-03-03 14:41:58,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952024749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:41:58,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:41:58,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:41:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614922364] [2025-03-03 14:41:58,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:41:58,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:41:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:41:58,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:41:58,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:41:58,550 INFO L87 Difference]: Start difference. First operand has 83 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 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 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:41:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:41:58,571 INFO L93 Difference]: Finished difference Result 140 states and 181 transitions. [2025-03-03 14:41:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:41:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 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 37 [2025-03-03 14:41:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:41:58,578 INFO L225 Difference]: With dead ends: 140 [2025-03-03 14:41:58,579 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 14:41:58,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:41:58,584 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:41:58,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:41:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 14:41:58,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 14:41:58,614 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) [2025-03-03 14:41:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2025-03-03 14:41:58,621 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 37 [2025-03-03 14:41:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:41:58,623 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2025-03-03 14:41:58,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:41:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2025-03-03 14:41:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:41:58,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:41:58,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:41:58,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:41:58,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:41:58,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:41:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2074525911, now seen corresponding path program 1 times [2025-03-03 14:41:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:41:58,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123749662] [2025-03-03 14:41:58,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:41:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:41:58,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:41:58,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:41:58,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:41:58,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:41:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:41:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:41:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123749662] [2025-03-03 14:41:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123749662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:41:58,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:41:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:41:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601594370] [2025-03-03 14:41:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:41:58,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:41:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:41:58,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:41:58,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:41:58,876 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:41:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:41:58,904 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2025-03-03 14:41:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:41:58,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 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 37 [2025-03-03 14:41:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:41:58,906 INFO L225 Difference]: With dead ends: 136 [2025-03-03 14:41:58,906 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 14:41:58,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:41:58,907 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:41:58,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:41:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 14:41:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 14:41:58,915 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) [2025-03-03 14:41:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2025-03-03 14:41:58,917 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 37 [2025-03-03 14:41:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:41:58,917 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2025-03-03 14:41:58,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:41:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2025-03-03 14:41:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 14:41:58,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:41:58,918 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:41:58,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:41:58,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:41:58,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:41:58,919 INFO L85 PathProgramCache]: Analyzing trace with hash 132436836, now seen corresponding path program 1 times [2025-03-03 14:41:58,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:41:58,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794404737] [2025-03-03 14:41:58,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:41:58,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:41:58,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 14:41:58,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 14:41:58,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:41:58,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:41:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:41:59,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:41:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794404737] [2025-03-03 14:41:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794404737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:41:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54585950] [2025-03-03 14:41:59,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:41:59,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:41:59,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:41:59,182 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) [2025-03-03 14:41:59,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:41:59,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 14:41:59,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 14:41:59,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:41:59,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:41:59,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 14:41:59,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:41:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:41:59,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:41:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:41:59,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54585950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:41:59,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:41:59,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2025-03-03 14:41:59,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418828303] [2025-03-03 14:41:59,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:41:59,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:41:59,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:41:59,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:41:59,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:41:59,567 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-03 14:41:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:41:59,651 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2025-03-03 14:41:59,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:41:59,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 49 [2025-03-03 14:41:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:41:59,652 INFO L225 Difference]: With dead ends: 144 [2025-03-03 14:41:59,653 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 14:41:59,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:41:59,654 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:41:59,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 729 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:41:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 14:41:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 14:41:59,663 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) [2025-03-03 14:41:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2025-03-03 14:41:59,664 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 49 [2025-03-03 14:41:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:41:59,664 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2025-03-03 14:41:59,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-03 14:41:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2025-03-03 14:41:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:41:59,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:41:59,665 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:41:59,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:41:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:41:59,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:41:59,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:41:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -941516956, now seen corresponding path program 1 times [2025-03-03 14:41:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:41:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375070636] [2025-03-03 14:41:59,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:41:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:41:59,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:41:59,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:41:59,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:41:59,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:42:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375070636] [2025-03-03 14:42:00,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375070636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:00,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:00,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:42:00,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985771001] [2025-03-03 14:42:00,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:00,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:42:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:00,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:42:00,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:42:00,004 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:42:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:00,051 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2025-03-03 14:42:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:42:00,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 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 61 [2025-03-03 14:42:00,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:00,053 INFO L225 Difference]: With dead ends: 144 [2025-03-03 14:42:00,054 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 14:42:00,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:42:00,056 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 16 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:00,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 617 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:42:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 14:42:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-03 14:42:00,065 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) [2025-03-03 14:42:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2025-03-03 14:42:00,067 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 61 [2025-03-03 14:42:00,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:00,068 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2025-03-03 14:42:00,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:42:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2025-03-03 14:42:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:42:00,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:00,070 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:42:00,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:42:00,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:00,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1771749336, now seen corresponding path program 1 times [2025-03-03 14:42:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220577627] [2025-03-03 14:42:00,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:00,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:42:00,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:42:00,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:00,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:42:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:42:00,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:42:00,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220577627] [2025-03-03 14:42:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220577627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:42:00,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:42:00,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:42:00,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597408204] [2025-03-03 14:42:00,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:42:00,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:42:00,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:42:00,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:42:00,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:42:00,196 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:42:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:42:00,272 INFO L93 Difference]: Finished difference Result 138 states and 179 transitions. [2025-03-03 14:42:00,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:42:00,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 2 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 74 [2025-03-03 14:42:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:42:00,273 INFO L225 Difference]: With dead ends: 138 [2025-03-03 14:42:00,273 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 14:42:00,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:42:00,274 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 11 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:42:00,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 615 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:42:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 14:42:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 14:42:00,285 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) [2025-03-03 14:42:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2025-03-03 14:42:00,287 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 74 [2025-03-03 14:42:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:42:00,288 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2025-03-03 14:42:00,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:42:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2025-03-03 14:42:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:42:00,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:42:00,289 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:42:00,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:42:00,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:42:00,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:42:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash 265944155, now seen corresponding path program 1 times [2025-03-03 14:42:00,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:42:00,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036466881] [2025-03-03 14:42:00,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:42:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:42:00,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:42:00,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:42:00,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:00,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:42:00,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 14:42:00,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:42:00,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:42:00,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:42:00,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:42:00,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 14:42:00,362 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 14:42:00,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:42:00,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:42:00,366 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 14:42:00,402 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:42:00,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:42:00 BoogieIcfgContainer [2025-03-03 14:42:00,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:42:00,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:42:00,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:42:00,406 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:42:00,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:41:58" (3/4) ... [2025-03-03 14:42:00,407 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 14:42:00,443 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 44. [2025-03-03 14:42:00,499 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:42:00,500 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:42:00,500 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:42:00,500 INFO L158 Benchmark]: Toolchain (without parser) took 2866.34ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 97.0MB in the end (delta: 26.0MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2025-03-03 14:42:00,500 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:42:00,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.96ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 110.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:42:00,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.38ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:42:00,501 INFO L158 Benchmark]: Boogie Preprocessor took 50.62ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:42:00,501 INFO L158 Benchmark]: IcfgBuilder took 376.12ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 84.1MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:42:00,501 INFO L158 Benchmark]: TraceAbstraction took 2118.16ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 105.4MB in the end (delta: -22.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:42:00,501 INFO L158 Benchmark]: Witness Printer took 93.67ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 97.0MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:42:00,502 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.96ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 110.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.38ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 108.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.62ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.0MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 376.12ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 84.1MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2118.16ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 105.4MB in the end (delta: -22.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 93.67ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 97.0MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. 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}] [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}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}] [L98] RET, EXPR nondet_tree() [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [\old(n)={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [\old(n)={-2:0}, n={-2:0}] [L40] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L40] RET, EXPR min(n->left) VAL [\old(n)={-2:0}, n={-2:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [\old(n)={-2:0}, a=2147483647] [L41] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->right) VAL [\old(n)={-2:0}, a=2147483647] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\old(n)={-2:0}, \result=2147483647] [L76] RET, EXPR min(t) VAL [t={-2:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-2:0}] [L79] CALL, EXPR size(t) VAL [\old(t)={-2:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [\old(t)={-2:0}, t={-2:0}] [L72] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->left) VAL [\old(t)={-2:0}, t={-2:0}] [L72] EXPR t->right VAL [\old(t)={-2:0}] [L72] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->right) VAL [\old(t)={-2:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-2:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-2:0}] [L81] int *x = calloc(n, sizeof(int)); [L82] CALL tree_inorder(t, x, n) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, a={-3:0}, i=1, t={-2:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-3:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, a={-3:0}, i=1, t={-2:0}] [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(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, a={-3:0}, i=2] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-3:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, a={-3:0}, i=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, \result=2, a={-3:0}, i=2] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-2:0}, x={-3:0}] [L83] EXPR x[0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0] [L16] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 2454 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1965 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 221 IncrementalHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 489 mSDtfsCounter, 221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=5, InterpolantAutomatonStates: 31, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 736 SizeOfPredicates, 2 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 90/96 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-03 14:42:00,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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