./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.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/recursified_loop-simple/recursified_deep-nested.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 dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:37:51,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:37:51,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:37:51,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:37:51,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:37:51,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:37:51,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:37:51,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:37:51,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:37:51,945 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:37:51,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:37:51,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:37:51,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:37:51,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:37:51,948 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:37:51,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:37:51,948 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:37:51,948 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:37:51,948 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:37:51,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:37:51,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:37:51,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:37:51,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:37:51,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:37:51,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:37:51,949 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:37:51,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:37:51,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:37:51,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:37:51,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:37:51,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:37:51,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:37:51,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:37:51,950 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 -> dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a [2025-03-03 14:37:52,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:37:52,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:37:52,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:37:52,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:37:52,167 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:37:52,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2025-03-03 14:37:53,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3668a795e/28472776f11c4adc916a6caa5b3bafc3/FLAG3bdb058e6 [2025-03-03 14:37:53,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:37:53,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2025-03-03 14:37:53,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3668a795e/28472776f11c4adc916a6caa5b3bafc3/FLAG3bdb058e6 [2025-03-03 14:37:53,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3668a795e/28472776f11c4adc916a6caa5b3bafc3 [2025-03-03 14:37:53,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:37:53,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:37:53,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:37:53,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:37:53,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:37:53,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be8058c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53, skipping insertion in model container [2025-03-03 14:37:53,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:37:53,627 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/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2025-03-03 14:37:53,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:37:53,652 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:37:53,661 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/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2025-03-03 14:37:53,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:37:53,688 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:37:53,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53 WrapperNode [2025-03-03 14:37:53,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:37:53,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:37:53,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:37:53,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:37:53,695 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:37:53" (1/1) ... [2025-03-03 14:37:53,701 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:37:53" (1/1) ... [2025-03-03 14:37:53,712 INFO L138 Inliner]: procedures = 16, calls = 71, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2025-03-03 14:37:53,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:37:53,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:37:53,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:37:53,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:37:53,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,747 INFO L175 MemorySlicer]: Split 38 memory accesses to 7 slices as follows [2, 7, 6, 6, 5, 6, 6]. 18 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 11 writes are split as follows [0, 1, 2, 2, 2, 2, 2]. [2025-03-03 14:37:53,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,757 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:37:53,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:37:53,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:37:53,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:37:53,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (1/1) ... [2025-03-03 14:37:53,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:37:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:37:53,790 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:37:53,792 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:37:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_13_0 [2025-03-03 14:37:53,810 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_13_0 [2025-03-03 14:37:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:37:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_14_0 [2025-03-03 14:37:53,810 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_14_0 [2025-03-03 14:37:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_11_to_12_0 [2025-03-03 14:37:53,810 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_11_to_12_0 [2025-03-03 14:37:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:37:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:37:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:37:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:37:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:37:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:37:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:37:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_14_to_16_0 [2025-03-03 14:37:53,811 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_14_to_16_0 [2025-03-03 14:37:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_10_to_11_0 [2025-03-03 14:37:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_10_to_11_0 [2025-03-03 14:37:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:37:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:37:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:37:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:37:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:37:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:37:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:37:53,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 14:37:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:37:53,916 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:37:53,917 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:37:54,130 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#e~0#1.base, main_~#e~0#1.offset);havoc main_~#e~0#1.base, main_~#e~0#1.offset;call ULTIMATE.dealloc(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset);havoc main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset; [2025-03-03 14:37:54,164 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 14:37:54,164 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:37:54,172 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:37:54,173 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:37:54,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:37:54 BoogieIcfgContainer [2025-03-03 14:37:54,173 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:37:54,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:37:54,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:37:54,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:37:54,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:37:53" (1/3) ... [2025-03-03 14:37:54,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745b5d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:37:54, skipping insertion in model container [2025-03-03 14:37:54,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:53" (2/3) ... [2025-03-03 14:37:54,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745b5d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:37:54, skipping insertion in model container [2025-03-03 14:37:54,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:37:54" (3/3) ... [2025-03-03 14:37:54,179 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_deep-nested.c [2025-03-03 14:37:54,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:37:54,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_deep-nested.c that has 6 procedures, 51 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:37:54,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:37:54,233 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;@16fceb2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:37:54,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:37:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 14:37:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 14:37:54,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:54,242 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] [2025-03-03 14:37:54,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:37:54,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:54,246 INFO L85 PathProgramCache]: Analyzing trace with hash -717232106, now seen corresponding path program 1 times [2025-03-03 14:37:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706744014] [2025-03-03 14:37:54,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:54,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 14:37:54,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 14:37:54,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:54,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:55,510 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:37:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706744014] [2025-03-03 14:37:55,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706744014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:55,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:37:55,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 14:37:55,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558364220] [2025-03-03 14:37:55,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:55,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:37:55,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:55,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:37:55,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:37:55,532 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:37:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:55,937 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2025-03-03 14:37:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:37:55,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-03 14:37:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:55,945 INFO L225 Difference]: With dead ends: 115 [2025-03-03 14:37:55,946 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 14:37:55,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:37:55,950 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 59 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:37:55,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 437 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:37:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 14:37:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-03-03 14:37:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 46 states have internal predecessors, (55), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 14:37:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2025-03-03 14:37:55,987 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 26 [2025-03-03 14:37:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:55,987 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-03-03 14:37:55,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:37:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2025-03-03 14:37:55,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 14:37:55,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:55,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:55,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:37:55,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:37:55,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash -509063859, now seen corresponding path program 1 times [2025-03-03 14:37:55,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:55,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361256822] [2025-03-03 14:37:55,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:55,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:56,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 14:37:56,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:37:56,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:56,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:37:57,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:57,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361256822] [2025-03-03 14:37:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361256822] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:37:57,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156913337] [2025-03-03 14:37:57,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:57,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:37:57,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:37:57,009 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:37:57,011 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:37:57,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 14:37:57,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:37:57,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:57,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-03 14:37:57,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:37:57,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:37:57,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:37:57,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:37:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:37:57,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:37:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:37:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156913337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:37:58,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:37:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 43 [2025-03-03 14:37:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867078594] [2025-03-03 14:37:58,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:37:58,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 14:37:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:58,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 14:37:58,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1698, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:37:58,220 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 43 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 28 states have internal predecessors, (91), 16 states have call successors, (18), 16 states have call predecessors, (18), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:38:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:00,301 INFO L93 Difference]: Finished difference Result 216 states and 308 transitions. [2025-03-03 14:38:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-03 14:38:00,302 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 28 states have internal predecessors, (91), 16 states have call successors, (18), 16 states have call predecessors, (18), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 14:38:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:00,303 INFO L225 Difference]: With dead ends: 216 [2025-03-03 14:38:00,303 INFO L226 Difference]: Without dead ends: 162 [2025-03-03 14:38:00,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=547, Invalid=5615, Unknown=0, NotChecked=0, Total=6162 [2025-03-03 14:38:00,306 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 372 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:00,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1107 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:38:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-03 14:38:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2025-03-03 14:38:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 122 states have internal predecessors, (151), 15 states have call successors, (15), 12 states have call predecessors, (15), 13 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2025-03-03 14:38:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 189 transitions. [2025-03-03 14:38:00,329 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 189 transitions. Word has length 38 [2025-03-03 14:38:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:00,329 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 189 transitions. [2025-03-03 14:38:00,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 28 states have internal predecessors, (91), 16 states have call successors, (18), 16 states have call predecessors, (18), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:38:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 189 transitions. [2025-03-03 14:38:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:38:00,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:00,332 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:00,339 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:38:00,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:00,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:00,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:00,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2077938995, now seen corresponding path program 1 times [2025-03-03 14:38:00,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:00,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684281217] [2025-03-03 14:38:00,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:00,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:38:00,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:38:00,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:00,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 68 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:38:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684281217] [2025-03-03 14:38:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684281217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727609296] [2025-03-03 14:38:01,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:01,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:01,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:01,823 INFO L229 MonitoredProcess]: Starting monitored process 3 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:38:01,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:38:01,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:38:02,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:38:02,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:02,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:02,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 232 conjuncts are in the unsatisfiable core [2025-03-03 14:38:02,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:02,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:02,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:02,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:02,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-03 14:38:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 74 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:38:02,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:03,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2025-03-03 14:38:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 14:38:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727609296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:03,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 11] total 46 [2025-03-03 14:38:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525737955] [2025-03-03 14:38:03,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 14:38:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:03,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 14:38:03,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 14:38:03,317 INFO L87 Difference]: Start difference. First operand 141 states and 189 transitions. Second operand has 46 states, 41 states have (on average 3.024390243902439) internal successors, (124), 35 states have internal predecessors, (124), 14 states have call successors, (19), 13 states have call predecessors, (19), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:38:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:06,219 INFO L93 Difference]: Finished difference Result 529 states and 735 transitions. [2025-03-03 14:38:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-03-03 14:38:06,219 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 3.024390243902439) internal successors, (124), 35 states have internal predecessors, (124), 14 states have call successors, (19), 13 states have call predecessors, (19), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 14:38:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:06,222 INFO L225 Difference]: With dead ends: 529 [2025-03-03 14:38:06,222 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 14:38:06,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3368 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1338, Invalid=12002, Unknown=0, NotChecked=0, Total=13340 [2025-03-03 14:38:06,227 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 622 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 2263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:06,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1355 Invalid, 2263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:38:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 14:38:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 335. [2025-03-03 14:38:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 268 states have (on average 1.3246268656716418) internal successors, (355), 294 states have internal predecessors, (355), 31 states have call successors, (31), 26 states have call predecessors, (31), 35 states have return successors, (68), 23 states have call predecessors, (68), 29 states have call successors, (68) [2025-03-03 14:38:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2025-03-03 14:38:06,267 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 74 [2025-03-03 14:38:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:06,267 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2025-03-03 14:38:06,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 3.024390243902439) internal successors, (124), 35 states have internal predecessors, (124), 14 states have call successors, (19), 13 states have call predecessors, (19), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:38:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2025-03-03 14:38:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:38:06,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:06,272 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:06,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:38:06,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 14:38:06,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:06,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash 472928114, now seen corresponding path program 1 times [2025-03-03 14:38:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:06,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084103843] [2025-03-03 14:38:06,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:06,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:06,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:38:06,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:38:06,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:06,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:38:07,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084103843] [2025-03-03 14:38:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084103843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 14:38:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663221629] [2025-03-03 14:38:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:07,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:38:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:07,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:38:07,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:38:07,184 INFO L87 Difference]: Start difference. First operand 335 states and 454 transitions. Second operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:38:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:07,566 INFO L93 Difference]: Finished difference Result 691 states and 945 transitions. [2025-03-03 14:38:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:38:07,567 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2025-03-03 14:38:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:07,569 INFO L225 Difference]: With dead ends: 691 [2025-03-03 14:38:07,569 INFO L226 Difference]: Without dead ends: 353 [2025-03-03 14:38:07,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:38:07,571 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 74 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:07,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 358 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:07,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-03 14:38:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 343. [2025-03-03 14:38:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 272 states have (on average 1.3088235294117647) internal successors, (356), 295 states have internal predecessors, (356), 31 states have call successors, (31), 26 states have call predecessors, (31), 39 states have return successors, (73), 23 states have call predecessors, (73), 29 states have call successors, (73) [2025-03-03 14:38:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 460 transitions. [2025-03-03 14:38:07,602 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 460 transitions. Word has length 83 [2025-03-03 14:38:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:07,602 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 460 transitions. [2025-03-03 14:38:07,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:38:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 460 transitions. [2025-03-03 14:38:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:38:07,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:07,606 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:07,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:38:07,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:07,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 634765181, now seen corresponding path program 1 times [2025-03-03 14:38:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548598554] [2025-03-03 14:38:07,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:07,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:38:07,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:38:07,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:07,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:38:08,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:08,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548598554] [2025-03-03 14:38:08,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548598554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:08,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:08,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 14:38:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967108608] [2025-03-03 14:38:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:08,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:38:08,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:08,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:38:08,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:38:08,279 INFO L87 Difference]: Start difference. First operand 343 states and 460 transitions. Second operand has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:38:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,632 INFO L93 Difference]: Finished difference Result 691 states and 933 transitions. [2025-03-03 14:38:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:38:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2025-03-03 14:38:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,634 INFO L225 Difference]: With dead ends: 691 [2025-03-03 14:38:08,634 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 14:38:08,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:38:08,636 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:08,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 138 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 14:38:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 341. [2025-03-03 14:38:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 271 states have (on average 1.3025830258302582) internal successors, (353), 292 states have internal predecessors, (353), 31 states have call successors, (31), 26 states have call predecessors, (31), 38 states have return successors, (72), 23 states have call predecessors, (72), 29 states have call successors, (72) [2025-03-03 14:38:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2025-03-03 14:38:08,665 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 83 [2025-03-03 14:38:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:08,665 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2025-03-03 14:38:08,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:38:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2025-03-03 14:38:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:38:08,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,667 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:08,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:38:08,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:08,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash -851190824, now seen corresponding path program 1 times [2025-03-03 14:38:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:08,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998680219] [2025-03-03 14:38:08,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:08,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:38:08,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:38:08,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 14:38:09,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998680219] [2025-03-03 14:38:09,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998680219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:09,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124976371] [2025-03-03 14:38:09,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:09,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:09,662 INFO L229 MonitoredProcess]: Starting monitored process 4 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:38:09,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:38:09,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:38:09,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:38:09,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:09,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-03 14:38:09,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:09,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:09,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:38:10,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:10,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:38:10,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-03 14:38:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 107 proven. 37 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:38:10,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 132 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:38:10,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124976371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:10,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:10,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 42 [2025-03-03 14:38:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089537912] [2025-03-03 14:38:10,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:10,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 14:38:10,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:10,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 14:38:10,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1621, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 14:38:10,559 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand has 42 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 29 states have internal predecessors, (124), 19 states have call successors, (24), 16 states have call predecessors, (24), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 14:38:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:12,748 INFO L93 Difference]: Finished difference Result 842 states and 1153 transitions. [2025-03-03 14:38:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-03 14:38:12,751 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 29 states have internal predecessors, (124), 19 states have call successors, (24), 16 states have call predecessors, (24), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 97 [2025-03-03 14:38:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:12,754 INFO L225 Difference]: With dead ends: 842 [2025-03-03 14:38:12,754 INFO L226 Difference]: Without dead ends: 482 [2025-03-03 14:38:12,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=540, Invalid=7650, Unknown=0, NotChecked=0, Total=8190 [2025-03-03 14:38:12,757 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 313 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:12,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1500 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:38:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-03 14:38:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 463. [2025-03-03 14:38:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 373 states have (on average 1.2788203753351206) internal successors, (477), 397 states have internal predecessors, (477), 43 states have call successors, (43), 34 states have call predecessors, (43), 46 states have return successors, (101), 32 states have call predecessors, (101), 41 states have call successors, (101) [2025-03-03 14:38:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 621 transitions. [2025-03-03 14:38:12,788 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 621 transitions. Word has length 97 [2025-03-03 14:38:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:12,789 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 621 transitions. [2025-03-03 14:38:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 29 states have internal predecessors, (124), 19 states have call successors, (24), 16 states have call predecessors, (24), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 14:38:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 621 transitions. [2025-03-03 14:38:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:38:12,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:12,790 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:12,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:12,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:12,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:12,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:12,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1658770270, now seen corresponding path program 1 times [2025-03-03 14:38:12,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:12,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386189699] [2025-03-03 14:38:12,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:13,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:38:13,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:38:13,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:13,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 140 proven. 8 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-03 14:38:14,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386189699] [2025-03-03 14:38:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386189699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594559798] [2025-03-03 14:38:14,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:14,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:14,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:14,383 INFO L229 MonitoredProcess]: Starting monitored process 5 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:38:14,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:38:14,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:38:14,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:38:14,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:14,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:14,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 188 conjuncts are in the unsatisfiable core [2025-03-03 14:38:14,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:14,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:14,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:14,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:15,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:38:15,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:15,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:38:15,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-03 14:38:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 126 proven. 105 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:38:15,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 208 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:38:16,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594559798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:16,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:16,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 19] total 61 [2025-03-03 14:38:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359900146] [2025-03-03 14:38:16,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:16,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-03 14:38:16,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:16,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-03 14:38:16,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3467, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 14:38:16,240 INFO L87 Difference]: Start difference. First operand 463 states and 621 transitions. Second operand has 61 states, 49 states have (on average 3.306122448979592) internal successors, (162), 44 states have internal predecessors, (162), 25 states have call successors, (29), 20 states have call predecessors, (29), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:38:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:22,093 INFO L93 Difference]: Finished difference Result 1189 states and 1722 transitions. [2025-03-03 14:38:22,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2025-03-03 14:38:22,093 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 49 states have (on average 3.306122448979592) internal successors, (162), 44 states have internal predecessors, (162), 25 states have call successors, (29), 20 states have call predecessors, (29), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 111 [2025-03-03 14:38:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:22,097 INFO L225 Difference]: With dead ends: 1189 [2025-03-03 14:38:22,097 INFO L226 Difference]: Without dead ends: 697 [2025-03-03 14:38:22,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7286 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1748, Invalid=26644, Unknown=0, NotChecked=0, Total=28392 [2025-03-03 14:38:22,104 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 439 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 2562 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:22,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1291 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2562 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:38:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-03-03 14:38:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 646. [2025-03-03 14:38:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 529 states have (on average 1.2344045368620038) internal successors, (653), 553 states have internal predecessors, (653), 57 states have call successors, (57), 47 states have call predecessors, (57), 59 states have return successors, (134), 46 states have call predecessors, (134), 55 states have call successors, (134) [2025-03-03 14:38:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 844 transitions. [2025-03-03 14:38:22,167 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 844 transitions. Word has length 111 [2025-03-03 14:38:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:22,167 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 844 transitions. [2025-03-03 14:38:22,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 49 states have (on average 3.306122448979592) internal successors, (162), 44 states have internal predecessors, (162), 25 states have call successors, (29), 20 states have call predecessors, (29), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:38:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 844 transitions. [2025-03-03 14:38:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:38:22,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:22,169 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 3, 3, 2, 2, 2, 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] [2025-03-03 14:38:22,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:38:22,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:22,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:22,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 451370081, now seen corresponding path program 1 times [2025-03-03 14:38:22,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:22,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084975741] [2025-03-03 14:38:22,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:22,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:22,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:38:22,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:38:22,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:22,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 216 proven. 16 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-03 14:38:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:24,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084975741] [2025-03-03 14:38:24,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084975741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:24,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054708782] [2025-03-03 14:38:24,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:24,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:24,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:24,085 INFO L229 MonitoredProcess]: Starting monitored process 6 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:38:24,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:38:24,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:38:24,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:38:24,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:24,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:24,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 256 conjuncts are in the unsatisfiable core [2025-03-03 14:38:24,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:24,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:24,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:24,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 192 proven. 35 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-03 14:38:25,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:25,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-03 14:38:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 190 proven. 6 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-03 14:38:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054708782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:26,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:26,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 17] total 53 [2025-03-03 14:38:26,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845891238] [2025-03-03 14:38:26,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:26,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-03 14:38:26,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:26,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-03 14:38:26,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2579, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 14:38:26,422 INFO L87 Difference]: Start difference. First operand 646 states and 844 transitions. Second operand has 53 states, 42 states have (on average 3.238095238095238) internal successors, (136), 41 states have internal predecessors, (136), 22 states have call successors, (27), 13 states have call predecessors, (27), 11 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2025-03-03 14:38:30,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 14:38:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:37,788 INFO L93 Difference]: Finished difference Result 2105 states and 2841 transitions. [2025-03-03 14:38:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-03 14:38:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 42 states have (on average 3.238095238095238) internal successors, (136), 41 states have internal predecessors, (136), 22 states have call successors, (27), 13 states have call predecessors, (27), 11 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) Word has length 136 [2025-03-03 14:38:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:37,797 INFO L225 Difference]: With dead ends: 2105 [2025-03-03 14:38:37,798 INFO L226 Difference]: Without dead ends: 1428 [2025-03-03 14:38:37,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1490, Invalid=19390, Unknown=0, NotChecked=0, Total=20880 [2025-03-03 14:38:37,802 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 475 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 202 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 3124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:37,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 552 Invalid, 3124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 2921 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2025-03-03 14:38:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-03 14:38:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1379. [2025-03-03 14:38:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1135 states have (on average 1.2352422907488987) internal successors, (1402), 1181 states have internal predecessors, (1402), 118 states have call successors, (118), 95 states have call predecessors, (118), 125 states have return successors, (329), 104 states have call predecessors, (329), 110 states have call successors, (329) [2025-03-03 14:38:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1849 transitions. [2025-03-03 14:38:37,913 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1849 transitions. Word has length 136 [2025-03-03 14:38:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:37,913 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 1849 transitions. [2025-03-03 14:38:37,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 42 states have (on average 3.238095238095238) internal successors, (136), 41 states have internal predecessors, (136), 22 states have call successors, (27), 13 states have call predecessors, (27), 11 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2025-03-03 14:38:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1849 transitions. [2025-03-03 14:38:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 14:38:37,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:37,916 INFO L218 NwaCegarLoop]: trace histogram [13, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 8, 7, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:37,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:38,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:38,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:38,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1369344691, now seen corresponding path program 2 times [2025-03-03 14:38:38,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:38,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179524285] [2025-03-03 14:38:38,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:38,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 176 statements into 2 equivalence classes. [2025-03-03 14:38:38,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 14:38:38,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:38,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 370 proven. 112 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-03 14:38:40,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:40,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179524285] [2025-03-03 14:38:40,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179524285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:40,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302272058] [2025-03-03 14:38:40,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:40,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:40,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:40,411 INFO L229 MonitoredProcess]: Starting monitored process 7 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:38:40,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:38:40,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 176 statements into 2 equivalence classes. [2025-03-03 14:38:40,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 14:38:40,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:40,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:40,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 173 conjuncts are in the unsatisfiable core [2025-03-03 14:38:40,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:40,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:40,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:38:40,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:41,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:38:41,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:38:41,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:38:41,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:38:41,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-03 14:38:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 226 proven. 433 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 14:38:41,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 436 proven. 41 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 14:38:42,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302272058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:42,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:42,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 18] total 66 [2025-03-03 14:38:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685831485] [2025-03-03 14:38:42,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:42,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-03 14:38:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:42,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-03 14:38:42,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=4122, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 14:38:42,900 INFO L87 Difference]: Start difference. First operand 1379 states and 1849 transitions. Second operand has 66 states, 57 states have (on average 3.824561403508772) internal successors, (218), 44 states have internal predecessors, (218), 30 states have call successors, (35), 26 states have call predecessors, (35), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 14:38:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:51,071 INFO L93 Difference]: Finished difference Result 3929 states and 5456 transitions. [2025-03-03 14:38:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2025-03-03 14:38:51,072 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 57 states have (on average 3.824561403508772) internal successors, (218), 44 states have internal predecessors, (218), 30 states have call successors, (35), 26 states have call predecessors, (35), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 176 [2025-03-03 14:38:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:51,080 INFO L225 Difference]: With dead ends: 3929 [2025-03-03 14:38:51,081 INFO L226 Difference]: Without dead ends: 2553 [2025-03-03 14:38:51,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 346 SyntacticMatches, 2 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7628 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1164, Invalid=30698, Unknown=0, NotChecked=0, Total=31862 [2025-03-03 14:38:51,085 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 686 mSDsluCounter, 6252 mSDsCounter, 0 mSdLazyCounter, 7727 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 6423 SdHoareTripleChecker+Invalid, 7836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 7727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:51,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 6423 Invalid, 7836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 7727 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 14:38:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2025-03-03 14:38:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2216. [2025-03-03 14:38:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 1877 states have (on average 1.2440063931806074) internal successors, (2335), 1939 states have internal predecessors, (2335), 180 states have call successors, (180), 148 states have call predecessors, (180), 158 states have return successors, (459), 130 states have call predecessors, (459), 171 states have call successors, (459) [2025-03-03 14:38:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 2974 transitions. [2025-03-03 14:38:51,258 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 2974 transitions. Word has length 176 [2025-03-03 14:38:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:51,259 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 2974 transitions. [2025-03-03 14:38:51,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 57 states have (on average 3.824561403508772) internal successors, (218), 44 states have internal predecessors, (218), 30 states have call successors, (35), 26 states have call predecessors, (35), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 14:38:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 2974 transitions. [2025-03-03 14:38:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 14:38:51,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:51,263 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 8, 7, 6, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:51,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:51,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:51,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:51,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash -671448660, now seen corresponding path program 3 times [2025-03-03 14:38:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791059219] [2025-03-03 14:38:51,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:51,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 6 equivalence classes. [2025-03-03 14:38:51,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 122 of 188 statements. [2025-03-03 14:38:51,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 14:38:51,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 389 proven. 7 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2025-03-03 14:38:57,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791059219] [2025-03-03 14:38:57,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791059219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:57,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669004965] [2025-03-03 14:38:57,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:57,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:57,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:57,103 INFO L229 MonitoredProcess]: Starting monitored process 8 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:38:57,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:38:57,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 6 equivalence classes. [2025-03-03 14:38:57,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 122 of 188 statements. [2025-03-03 14:38:57,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 14:38:57,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:57,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-03 14:38:57,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-03-03 14:38:59,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:38:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669004965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:59,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:38:59,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 15 [2025-03-03 14:38:59,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467757478] [2025-03-03 14:38:59,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:59,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:38:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:59,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:38:59,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:38:59,825 INFO L87 Difference]: Start difference. First operand 2216 states and 2974 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:39:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:39:01,773 INFO L93 Difference]: Finished difference Result 6486 states and 9584 transitions. [2025-03-03 14:39:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:39:01,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 188 [2025-03-03 14:39:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:39:01,790 INFO L225 Difference]: With dead ends: 6486 [2025-03-03 14:39:01,791 INFO L226 Difference]: Without dead ends: 4273 [2025-03-03 14:39:01,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:39:01,797 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 20 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:39:01,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 307 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:39:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2025-03-03 14:39:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 3768. [2025-03-03 14:39:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 3154 states have (on average 1.1997463538363982) internal successors, (3784), 3321 states have internal predecessors, (3784), 333 states have call successors, (333), 234 states have call predecessors, (333), 280 states have return successors, (925), 214 states have call predecessors, (925), 324 states have call successors, (925) [2025-03-03 14:39:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 5042 transitions. [2025-03-03 14:39:02,233 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 5042 transitions. Word has length 188 [2025-03-03 14:39:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:39:02,234 INFO L471 AbstractCegarLoop]: Abstraction has 3768 states and 5042 transitions. [2025-03-03 14:39:02,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:39:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 5042 transitions. [2025-03-03 14:39:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 14:39:02,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:39:02,238 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 8, 7, 6, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:39:02,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:39:02,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:39:02,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:39:02,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:39:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1728222162, now seen corresponding path program 1 times [2025-03-03 14:39:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:39:02,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760747555] [2025-03-03 14:39:02,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:39:02,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:39:02,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 14:39:02,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 14:39:02,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:39:02,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:39:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 472 proven. 169 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-03 14:39:04,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:39:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760747555] [2025-03-03 14:39:04,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760747555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:39:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419395742] [2025-03-03 14:39:04,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:39:04,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:39:04,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:39:04,521 INFO L229 MonitoredProcess]: Starting monitored process 9 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:39:04,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:39:04,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 14:39:04,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 14:39:04,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:39:04,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:39:04,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1619 conjuncts, 203 conjuncts are in the unsatisfiable core [2025-03-03 14:39:04,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:39:04,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:39:04,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:39:05,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:39:06,196 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-03 14:39:06,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 14:39:06,200 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-03 14:39:06,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-03 14:39:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 446 proven. 206 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-03 14:39:06,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:39:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-03 14:39:06,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419395742] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 14:39:06,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:39:06,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [24, 22] total 54 [2025-03-03 14:39:06,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367484872] [2025-03-03 14:39:06,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:39:06,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:39:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:39:06,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:39:06,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2711, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 14:39:06,916 INFO L87 Difference]: Start difference. First operand 3768 states and 5042 transitions. Second operand has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:39:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:39:08,005 INFO L93 Difference]: Finished difference Result 9482 states and 13064 transitions. [2025-03-03 14:39:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:39:08,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 188 [2025-03-03 14:39:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:39:08,029 INFO L225 Difference]: With dead ends: 9482 [2025-03-03 14:39:08,029 INFO L226 Difference]: Without dead ends: 5717 [2025-03-03 14:39:08,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=185, Invalid=3475, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 14:39:08,041 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 61 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:39:08,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 445 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:39:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5717 states. [2025-03-03 14:39:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5717 to 5710. [2025-03-03 14:39:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5710 states, 4809 states have (on average 1.1900603035974215) internal successors, (5723), 5050 states have internal predecessors, (5723), 488 states have call successors, (488), 348 states have call predecessors, (488), 412 states have return successors, (1354), 313 states have call predecessors, (1354), 475 states have call successors, (1354) [2025-03-03 14:39:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 7565 transitions. [2025-03-03 14:39:08,637 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 7565 transitions. Word has length 188 [2025-03-03 14:39:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:39:08,637 INFO L471 AbstractCegarLoop]: Abstraction has 5710 states and 7565 transitions. [2025-03-03 14:39:08,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:39:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 7565 transitions. [2025-03-03 14:39:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 14:39:08,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:39:08,643 INFO L218 NwaCegarLoop]: trace histogram [14, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 8, 7, 6, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:39:08,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:39:08,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:39:08,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:39:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:39:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash 619691568, now seen corresponding path program 1 times [2025-03-03 14:39:08,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:39:08,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292585286] [2025-03-03 14:39:08,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:39:08,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:39:08,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 14:39:08,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 14:39:08,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:39:08,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:39:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 472 proven. 169 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-03 14:39:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:39:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292585286] [2025-03-03 14:39:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292585286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:39:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27758092] [2025-03-03 14:39:10,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:39:10,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:39:10,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:39:10,743 INFO L229 MonitoredProcess]: Starting monitored process 10 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:39:10,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:39:10,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 14:39:11,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 14:39:11,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:39:11,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:39:11,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 524 conjuncts are in the unsatisfiable core [2025-03-03 14:39:11,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:39:11,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:39:11,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:39:11,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:39:11,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:39:11,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:39:11,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-03-03 14:39:12,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:39:12,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:39:12,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 14:39:13,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 14:39:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 407 proven. 356 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 14:39:13,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:39:16,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27758092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:39:16,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:39:16,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 34] total 56 [2025-03-03 14:39:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790987404] [2025-03-03 14:39:16,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:39:16,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-03 14:39:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:39:16,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-03 14:39:16,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=6315, Unknown=0, NotChecked=0, Total=6642 [2025-03-03 14:39:16,192 INFO L87 Difference]: Start difference. First operand 5710 states and 7565 transitions. Second operand has 56 states, 47 states have (on average 3.4893617021276597) internal successors, (164), 42 states have internal predecessors, (164), 23 states have call successors, (27), 18 states have call predecessors, (27), 8 states have return successors, (13), 10 states have call predecessors, (13), 12 states have call successors, (13)