./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:34:08,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:34:08,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:34:08,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:34:08,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:34:08,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:34:08,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:34:08,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:34:08,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:34:08,905 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:34:08,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:34:08,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:34:08,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:34:08,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:34:08,906 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:34:08,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:34:08,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:34:08,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:34:08,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:34:08,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:34:08,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:34:08,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:34:08,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:34:08,910 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-jdk21/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 ! overflow) ) 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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2025-02-06 14:34:09,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:34:09,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:34:09,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:34:09,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:34:09,203 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:34:09,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-02-06 14:34:10,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62db96adf/1fcb7dbacfdb428ca9a6fa591fbbc6e9/FLAGb869b713c [2025-02-06 14:34:10,808 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:34:10,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-02-06 14:34:10,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62db96adf/1fcb7dbacfdb428ca9a6fa591fbbc6e9/FLAGb869b713c [2025-02-06 14:34:10,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62db96adf/1fcb7dbacfdb428ca9a6fa591fbbc6e9 [2025-02-06 14:34:10,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:34:10,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:34:10,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:34:10,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:34:10,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:34:10,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:10,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bebdb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10, skipping insertion in model container [2025-02-06 14:34:10,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:10,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:34:10,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:34:10,974 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:34:10,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:34:10,999 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:34:11,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11 WrapperNode [2025-02-06 14:34:11,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:34:11,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:34:11,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:34:11,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:34:11,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,028 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-02-06 14:34:11,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:34:11,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:34:11,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:34:11,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:34:11,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,059 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2025-02-06 14:34:11,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:34:11,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:34:11,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:34:11,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:34:11,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (1/1) ... [2025-02-06 14:34:11,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:34:11,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:11,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:34:11,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:34:11,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:34:11,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 14:34:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-02-06 14:34:11,150 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-02-06 14:34:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-02-06 14:34:11,150 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-02-06 14:34:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-02-06 14:34:11,150 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-02-06 14:34:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2025-02-06 14:34:11,150 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2025-02-06 14:34:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:34:11,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:34:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 14:34:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 14:34:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 14:34:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 14:34:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 14:34:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 14:34:11,234 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:34:11,236 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:34:11,459 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: 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; [2025-02-06 14:34:11,485 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-06 14:34:11,485 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:34:11,498 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:34:11,498 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:34:11,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:34:11 BoogieIcfgContainer [2025-02-06 14:34:11,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:34:11,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:34:11,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:34:11,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:34:11,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:34:10" (1/3) ... [2025-02-06 14:34:11,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5f231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:34:11, skipping insertion in model container [2025-02-06 14:34:11,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:11" (2/3) ... [2025-02-06 14:34:11,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5f231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:34:11, skipping insertion in model container [2025-02-06 14:34:11,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:34:11" (3/3) ... [2025-02-06 14:34:11,509 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_4.c [2025-02-06 14:34:11,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:34:11,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_4.c that has 5 procedures, 57 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-06 14:34:11,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:34:11,587 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;@5f8a5718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:34:11,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 14:34:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 48 states have internal predecessors, (52), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 14:34:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:34:11,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:11,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:11,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:11,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1332481360, now seen corresponding path program 1 times [2025-02-06 14:34:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482931648] [2025-02-06 14:34:11,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:11,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:11,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:34:11,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:34:11,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:11,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:12,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482931648] [2025-02-06 14:34:12,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482931648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:12,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:12,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:12,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216005362] [2025-02-06 14:34:12,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:12,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:12,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:12,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:12,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:12,203 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 48 states have internal predecessors, (52), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:12,465 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2025-02-06 14:34:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:12,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 14:34:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:12,473 INFO L225 Difference]: With dead ends: 114 [2025-02-06 14:34:12,474 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 14:34:12,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:12,481 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:12,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 143 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 14:34:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 14:34:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.44) internal successors, (36), 36 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-06 14:34:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-02-06 14:34:12,527 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 12 [2025-02-06 14:34:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:12,528 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-02-06 14:34:12,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-02-06 14:34:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:34:12,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:12,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:12,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:34:12,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:12,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1330038765, now seen corresponding path program 1 times [2025-02-06 14:34:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105453886] [2025-02-06 14:34:12,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:12,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:34:12,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:34:12,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:12,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:12,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105453886] [2025-02-06 14:34:12,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105453886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:12,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:12,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:12,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119166697] [2025-02-06 14:34:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:12,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:12,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:12,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:12,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:12,805 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:12,879 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2025-02-06 14:34:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:12,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 14:34:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:12,882 INFO L225 Difference]: With dead ends: 92 [2025-02-06 14:34:12,882 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 14:34:12,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:12,884 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:12,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 208 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 14:34:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-02-06 14:34:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 38 states have internal predecessors, (39), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-06 14:34:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-02-06 14:34:12,898 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 15 [2025-02-06 14:34:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:12,898 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-02-06 14:34:12,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-02-06 14:34:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 14:34:12,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:12,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:12,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:34:12,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:12,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1718471241, now seen corresponding path program 1 times [2025-02-06 14:34:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957301828] [2025-02-06 14:34:12,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:12,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:34:12,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:34:12,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:12,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957301828] [2025-02-06 14:34:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957301828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:12,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:34:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240072235] [2025-02-06 14:34:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:12,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:34:12,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:12,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:34:12,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:34:12,977 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:13,002 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2025-02-06 14:34:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:34:13,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 14:34:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:13,005 INFO L225 Difference]: With dead ends: 48 [2025-02-06 14:34:13,005 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 14:34:13,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:34:13,006 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:13,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 14:34:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 14:34:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 37 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-06 14:34:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-02-06 14:34:13,018 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 16 [2025-02-06 14:34:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:13,018 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-02-06 14:34:13,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-02-06 14:34:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:34:13,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:13,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:13,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:34:13,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:13,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1329380737, now seen corresponding path program 1 times [2025-02-06 14:34:13,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:13,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444713584] [2025-02-06 14:34:13,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:13,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:13,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:34:13,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:34:13,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:13,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444713584] [2025-02-06 14:34:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444713584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:13,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:13,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:13,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648492973] [2025-02-06 14:34:13,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:13,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:13,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:13,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:13,163 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:13,238 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2025-02-06 14:34:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:13,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-06 14:34:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:13,240 INFO L225 Difference]: With dead ends: 57 [2025-02-06 14:34:13,240 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 14:34:13,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:13,241 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:13,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 204 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 14:34:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-06 14:34:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 41 states have internal predecessors, (43), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-06 14:34:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-02-06 14:34:13,252 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 15 [2025-02-06 14:34:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:13,252 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-02-06 14:34:13,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-02-06 14:34:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 14:34:13,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:13,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:13,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:34:13,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:13,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1972807955, now seen corresponding path program 1 times [2025-02-06 14:34:13,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:13,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090745644] [2025-02-06 14:34:13,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:13,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:13,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 14:34:13,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 14:34:13,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:13,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:13,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:13,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090745644] [2025-02-06 14:34:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090745644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:13,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:13,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646959690] [2025-02-06 14:34:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:13,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:13,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:13,508 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:13,612 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-02-06 14:34:13,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:34:13,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 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 20 [2025-02-06 14:34:13,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:13,614 INFO L225 Difference]: With dead ends: 59 [2025-02-06 14:34:13,614 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 14:34:13,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:34:13,615 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:13,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 200 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 14:34:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2025-02-06 14:34:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 40 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-06 14:34:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-02-06 14:34:13,628 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 20 [2025-02-06 14:34:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:13,628 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-02-06 14:34:13,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-02-06 14:34:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 14:34:13,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:13,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:13,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:34:13,629 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:13,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:13,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1535451948, now seen corresponding path program 1 times [2025-02-06 14:34:13,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:13,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575064789] [2025-02-06 14:34:13,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:13,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:13,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 14:34:13,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 14:34:13,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:13,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:34:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575064789] [2025-02-06 14:34:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575064789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:13,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:13,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268391298] [2025-02-06 14:34:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:13,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:13,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:13,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:13,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:13,808 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:34:13,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:13,877 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-02-06 14:34:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:13,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-02-06 14:34:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:13,878 INFO L225 Difference]: With dead ends: 72 [2025-02-06 14:34:13,879 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 14:34:13,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:13,880 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:13,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 191 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 14:34:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2025-02-06 14:34:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 46 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-06 14:34:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2025-02-06 14:34:13,894 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 25 [2025-02-06 14:34:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:13,895 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2025-02-06 14:34:13,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:34:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2025-02-06 14:34:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 14:34:13,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:13,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:13,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:34:13,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:13,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:13,897 INFO L85 PathProgramCache]: Analyzing trace with hash 150788329, now seen corresponding path program 1 times [2025-02-06 14:34:13,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:13,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597612929] [2025-02-06 14:34:13,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:13,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:13,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 14:34:13,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 14:34:13,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:13,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:34:14,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:14,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597612929] [2025-02-06 14:34:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597612929] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989575926] [2025-02-06 14:34:14,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:14,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:14,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:14,102 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:14,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:34:14,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 14:34:14,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 14:34:14,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:14,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:14,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 14:34:14,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:14,267 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 15 treesize of output 1 [2025-02-06 14:34:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:34:14,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989575926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-02-06 14:34:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285515736] [2025-02-06 14:34:14,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:14,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:14,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:14,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:34:14,330 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:34:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:14,443 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2025-02-06 14:34:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-06 14:34:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:14,445 INFO L225 Difference]: With dead ends: 121 [2025-02-06 14:34:14,445 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 14:34:14,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:34:14,446 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:14,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 111 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 14:34:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-06 14:34:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 45 states have internal predecessors, (48), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-02-06 14:34:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2025-02-06 14:34:14,463 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 26 [2025-02-06 14:34:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:14,463 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2025-02-06 14:34:14,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:34:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2025-02-06 14:34:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 14:34:14,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:14,465 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:14,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:34:14,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:14,666 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:14,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:14,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1635739956, now seen corresponding path program 1 times [2025-02-06 14:34:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:14,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421961733] [2025-02-06 14:34:14,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:14,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:34:14,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:34:14,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:14,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 14:34:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421961733] [2025-02-06 14:34:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421961733] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147029135] [2025-02-06 14:34:15,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:15,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:15,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:15,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:15,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:34:15,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:34:15,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:34:15,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:15,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:15,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 14:34:15,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:15,312 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-02-06 14:34:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 14:34:15,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:34:16,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147029135] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:16,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:16,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2025-02-06 14:34:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474798967] [2025-02-06 14:34:16,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:16,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:34:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:16,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:34:16,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:34:16,005 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 24 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 21 states have internal predecessors, (50), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 14:34:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:16,278 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2025-02-06 14:34:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:34:16,280 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 21 states have internal predecessors, (50), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2025-02-06 14:34:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:16,281 INFO L225 Difference]: With dead ends: 123 [2025-02-06 14:34:16,281 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 14:34:16,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2025-02-06 14:34:16,282 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 28 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:16,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 278 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 14:34:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 14:34:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 47 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-06 14:34:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-02-06 14:34:16,291 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 43 [2025-02-06 14:34:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:16,291 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-02-06 14:34:16,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 21 states have internal predecessors, (50), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 14:34:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2025-02-06 14:34:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 14:34:16,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:16,295 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:16,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:16,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:16,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:16,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1899428180, now seen corresponding path program 2 times [2025-02-06 14:34:16,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:16,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488593691] [2025-02-06 14:34:16,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:16,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-06 14:34:16,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 14:34:16,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:16,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 11 proven. 106 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 14:34:17,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:17,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488593691] [2025-02-06 14:34:17,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488593691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:17,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374514556] [2025-02-06 14:34:17,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:17,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:17,426 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:17,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:34:17,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-06 14:34:17,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 14:34:17,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:17,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:17,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 14:34:17,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:17,581 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 15 treesize of output 1 [2025-02-06 14:34:17,765 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 17 treesize of output 9 [2025-02-06 14:34:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-06 14:34:17,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:17,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374514556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:17,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:17,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2025-02-06 14:34:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475374460] [2025-02-06 14:34:17,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:17,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:17,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:17,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-06 14:34:17,785 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:34:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:17,928 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2025-02-06 14:34:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:34:17,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 71 [2025-02-06 14:34:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:17,930 INFO L225 Difference]: With dead ends: 68 [2025-02-06 14:34:17,930 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 14:34:17,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-02-06 14:34:17,931 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 46 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:17,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 175 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 14:34:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2025-02-06 14:34:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 46 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-06 14:34:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-02-06 14:34:17,949 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 71 [2025-02-06 14:34:17,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:17,949 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-02-06 14:34:17,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:34:17,949 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-02-06 14:34:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 14:34:17,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:17,951 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:17,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 14:34:18,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:18,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:18,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1247268593, now seen corresponding path program 1 times [2025-02-06 14:34:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:18,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351145000] [2025-02-06 14:34:18,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:18,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:18,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 14:34:18,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 14:34:18,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:18,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-02-06 14:34:18,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:18,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351145000] [2025-02-06 14:34:18,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351145000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:18,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921803322] [2025-02-06 14:34:18,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:18,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:18,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:18,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:18,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:34:18,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 14:34:18,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 14:34:18,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:18,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:18,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:34:18,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:18,821 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 15 treesize of output 7 [2025-02-06 14:34:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-06 14:34:18,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921803322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-06 14:34:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111121190] [2025-02-06 14:34:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:18,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:18,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:34:18,840 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:34:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:18,910 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-02-06 14:34:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:18,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2025-02-06 14:34:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:18,913 INFO L225 Difference]: With dead ends: 64 [2025-02-06 14:34:18,913 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 14:34:18,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:18,914 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:18,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 166 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 14:34:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-02-06 14:34:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-06 14:34:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-02-06 14:34:18,930 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 72 [2025-02-06 14:34:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:18,931 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-02-06 14:34:18,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:34:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-02-06 14:34:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 14:34:18,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:18,932 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:18,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:34:19,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 14:34:19,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:19,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1008365745, now seen corresponding path program 1 times [2025-02-06 14:34:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:19,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984856313] [2025-02-06 14:34:19,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:19,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:19,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 14:34:19,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 14:34:19,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:19,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 14:34:19,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:19,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984856313] [2025-02-06 14:34:19,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984856313] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:19,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595702232] [2025-02-06 14:34:19,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:19,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:19,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:19,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:19,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:34:19,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 14:34:19,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 14:34:19,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:19,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:19,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 14:34:19,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:19,610 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 15 treesize of output 1 [2025-02-06 14:34:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 14:34:19,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 14:34:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595702232] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:20,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:20,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-02-06 14:34:20,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123272574] [2025-02-06 14:34:20,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:20,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 14:34:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:20,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 14:34:20,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-02-06 14:34:20,376 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 27 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (14), 8 states have call predecessors, (14), 11 states have call successors, (14) [2025-02-06 14:34:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:20,986 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2025-02-06 14:34:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 14:34:20,987 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (14), 8 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2025-02-06 14:34:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:20,988 INFO L225 Difference]: With dead ends: 119 [2025-02-06 14:34:20,988 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 14:34:20,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1313, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 14:34:20,990 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:20,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 148 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:34:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 14:34:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-06 14:34:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.175) internal successors, (47), 44 states have internal predecessors, (47), 9 states have call successors, (9), 7 states have call predecessors, (9), 10 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-06 14:34:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2025-02-06 14:34:21,000 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 59 [2025-02-06 14:34:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:21,001 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2025-02-06 14:34:21,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (14), 8 states have call predecessors, (14), 11 states have call successors, (14) [2025-02-06 14:34:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2025-02-06 14:34:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-06 14:34:21,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:21,006 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:21,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 14:34:21,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 14:34:21,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:21,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1390424745, now seen corresponding path program 1 times [2025-02-06 14:34:21,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:21,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076923632] [2025-02-06 14:34:21,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:21,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:21,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 14:34:21,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 14:34:21,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:21,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 15 proven. 309 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2025-02-06 14:34:22,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:22,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076923632] [2025-02-06 14:34:22,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076923632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:22,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791982535] [2025-02-06 14:34:22,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:22,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:22,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:22,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:22,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:34:22,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-06 14:34:22,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-06 14:34:22,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:22,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:22,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 14:34:22,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:22,605 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 15 treesize of output 1 [2025-02-06 14:34:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 423 proven. 8 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-02-06 14:34:22,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 3 proven. 73 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-02-06 14:34:24,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791982535] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:24,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:24,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 16] total 38 [2025-02-06 14:34:24,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452947784] [2025-02-06 14:34:24,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:24,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 14:34:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:24,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 14:34:24,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 14:34:24,090 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 38 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 33 states have internal predecessors, (80), 13 states have call successors, (24), 7 states have call predecessors, (24), 12 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2025-02-06 14:34:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:24,775 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2025-02-06 14:34:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 14:34:24,775 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 33 states have internal predecessors, (80), 13 states have call successors, (24), 7 states have call predecessors, (24), 12 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) Word has length 162 [2025-02-06 14:34:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:24,776 INFO L225 Difference]: With dead ends: 127 [2025-02-06 14:34:24,776 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 14:34:24,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=353, Invalid=2197, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 14:34:24,778 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 78 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:24,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 405 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:34:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 14:34:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-06 14:34:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 46 states have internal predecessors, (49), 9 states have call successors, (9), 7 states have call predecessors, (9), 12 states have return successors, (16), 13 states have call predecessors, (16), 7 states have call successors, (16) [2025-02-06 14:34:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-02-06 14:34:24,791 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 162 [2025-02-06 14:34:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:24,792 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-02-06 14:34:24,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 33 states have internal predecessors, (80), 13 states have call successors, (24), 7 states have call predecessors, (24), 12 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2025-02-06 14:34:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-02-06 14:34:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-06 14:34:24,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:24,794 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 24, 24, 24, 24, 24, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:24,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 14:34:24,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 14:34:24,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1526879919, now seen corresponding path program 2 times [2025-02-06 14:34:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131300407] [2025-02-06 14:34:24,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:25,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-02-06 14:34:25,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 272 of 272 statements. [2025-02-06 14:34:25,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:25,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2755 trivial. 0 not checked. [2025-02-06 14:34:25,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:25,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131300407] [2025-02-06 14:34:25,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131300407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:25,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626796988] [2025-02-06 14:34:25,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:25,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:25,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:25,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:25,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 14:34:25,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-02-06 14:34:26,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 272 of 272 statements. [2025-02-06 14:34:26,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:26,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:26,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-02-06 14:34:26,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:26,204 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-02-06 14:34:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 762 proven. 24 refuted. 0 times theorem prover too weak. 1974 trivial. 0 not checked. [2025-02-06 14:34:26,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 9 proven. 831 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2025-02-06 14:34:29,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626796988] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:29,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:29,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 26] total 51 [2025-02-06 14:34:29,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671102812] [2025-02-06 14:34:29,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:29,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-06 14:34:29,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:29,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-06 14:34:29,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2238, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 14:34:29,528 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 51 states, 42 states have (on average 2.142857142857143) internal successors, (90), 41 states have internal predecessors, (90), 15 states have call successors, (27), 12 states have call predecessors, (27), 12 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2025-02-06 14:34:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:30,493 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2025-02-06 14:34:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 14:34:30,493 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 42 states have (on average 2.142857142857143) internal successors, (90), 41 states have internal predecessors, (90), 15 states have call successors, (27), 12 states have call predecessors, (27), 12 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) Word has length 272 [2025-02-06 14:34:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:30,494 INFO L225 Difference]: With dead ends: 133 [2025-02-06 14:34:30,494 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 14:34:30,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=564, Invalid=4406, Unknown=0, NotChecked=0, Total=4970 [2025-02-06 14:34:30,499 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 113 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:30,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 599 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 14:34:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 14:34:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-06 14:34:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 47 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 13 states have return successors, (19), 14 states have call predecessors, (19), 8 states have call successors, (19) [2025-02-06 14:34:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-02-06 14:34:30,518 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 272 [2025-02-06 14:34:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:30,519 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-02-06 14:34:30,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 42 states have (on average 2.142857142857143) internal successors, (90), 41 states have internal predecessors, (90), 15 states have call successors, (27), 12 states have call predecessors, (27), 12 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2025-02-06 14:34:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-02-06 14:34:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-06 14:34:30,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:30,522 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 30, 30, 30, 30, 30, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:30,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 14:34:30,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:30,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:30,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:30,724 INFO L85 PathProgramCache]: Analyzing trace with hash 228578949, now seen corresponding path program 1 times [2025-02-06 14:34:30,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:30,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136513770] [2025-02-06 14:34:30,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:30,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:30,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 14:34:30,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 14:34:30,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:30,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4018 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4012 trivial. 0 not checked. [2025-02-06 14:34:31,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:31,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136513770] [2025-02-06 14:34:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136513770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913399023] [2025-02-06 14:34:31,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:31,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:31,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:31,458 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:31,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 14:34:31,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 14:34:31,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 14:34:31,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:31,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:31,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:34:31,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:32,093 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 15 treesize of output 7 [2025-02-06 14:34:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4018 backedges. 2085 proven. 0 refuted. 0 times theorem prover too weak. 1933 trivial. 0 not checked. [2025-02-06 14:34:32,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:32,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913399023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:32,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:32,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-06 14:34:32,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518802381] [2025-02-06 14:34:32,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:32,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:32,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:32,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:32,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:34:32,110 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 14:34:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:32,165 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-02-06 14:34:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 315 [2025-02-06 14:34:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:32,166 INFO L225 Difference]: With dead ends: 69 [2025-02-06 14:34:32,166 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 14:34:32,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:32,167 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:32,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 124 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 14:34:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 14:34:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 10 states have call successors, (10), 7 states have call predecessors, (10), 13 states have return successors, (19), 14 states have call predecessors, (19), 8 states have call successors, (19) [2025-02-06 14:34:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-02-06 14:34:32,180 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 315 [2025-02-06 14:34:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:32,181 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-02-06 14:34:32,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 14:34:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-02-06 14:34:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-02-06 14:34:32,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:32,187 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 30, 30, 30, 30, 30, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:32,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 14:34:32,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:32,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:32,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:32,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1469044, now seen corresponding path program 2 times [2025-02-06 14:34:32,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:32,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138129974] [2025-02-06 14:34:32,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:32,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:32,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 326 statements into 2 equivalence classes. [2025-02-06 14:34:32,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 326 statements. [2025-02-06 14:34:32,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 14:34:32,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4029 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4029 trivial. 0 not checked. [2025-02-06 14:34:32,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:32,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138129974] [2025-02-06 14:34:32,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138129974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:32,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:32,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:32,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808770548] [2025-02-06 14:34:32,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:32,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:32,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:32,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:32,469 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 14:34:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:32,518 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-02-06 14:34:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:32,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2025-02-06 14:34:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:32,519 INFO L225 Difference]: With dead ends: 76 [2025-02-06 14:34:32,519 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 14:34:32,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:32,520 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:32,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 184 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 14:34:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-06 14:34:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 11 states have call successors, (11), 8 states have call predecessors, (11), 13 states have return successors, (20), 15 states have call predecessors, (20), 9 states have call successors, (20) [2025-02-06 14:34:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-02-06 14:34:32,533 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 326 [2025-02-06 14:34:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:32,534 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-02-06 14:34:32,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 14:34:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-02-06 14:34:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-02-06 14:34:32,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:32,544 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 60, 60, 60, 60, 60, 16, 16, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:32,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:34:32,545 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:32,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash 804316670, now seen corresponding path program 1 times [2025-02-06 14:34:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32378957] [2025-02-06 14:34:32,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:32,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-06 14:34:32,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-06 14:34:32,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:32,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16439 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16434 trivial. 0 not checked. [2025-02-06 14:34:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32378957] [2025-02-06 14:34:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32378957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056567501] [2025-02-06 14:34:34,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:34,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:34,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:34,252 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:34,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 14:34:34,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-02-06 14:34:34,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-02-06 14:34:34,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:34,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:34,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 2542 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-02-06 14:34:34,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:34,775 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-02-06 14:34:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16439 backedges. 9473 proven. 35 refuted. 0 times theorem prover too weak. 6931 trivial. 0 not checked. [2025-02-06 14:34:35,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16439 backedges. 1386 proven. 1222 refuted. 0 times theorem prover too weak. 13831 trivial. 0 not checked. [2025-02-06 14:34:40,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056567501] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:40,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:40,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 31] total 50 [2025-02-06 14:34:40,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679553529] [2025-02-06 14:34:40,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:40,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 14:34:40,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:40,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 14:34:40,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=2066, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 14:34:40,458 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 50 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 13 states have call successors, (27), 11 states have call predecessors, (27), 14 states have return successors, (29), 14 states have call predecessors, (29), 12 states have call successors, (29) [2025-02-06 14:34:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:41,018 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2025-02-06 14:34:41,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 14:34:41,019 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 13 states have call successors, (27), 11 states have call predecessors, (27), 14 states have return successors, (29), 14 states have call predecessors, (29), 12 states have call successors, (29) Word has length 651 [2025-02-06 14:34:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:41,019 INFO L225 Difference]: With dead ends: 144 [2025-02-06 14:34:41,019 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 14:34:41,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1322 GetRequests, 1262 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=556, Invalid=3226, Unknown=0, NotChecked=0, Total=3782 [2025-02-06 14:34:41,021 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 62 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:41,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 582 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:34:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 14:34:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-02-06 14:34:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 11 states have call successors, (11), 8 states have call predecessors, (11), 14 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2025-02-06 14:34:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2025-02-06 14:34:41,031 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 651 [2025-02-06 14:34:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:41,031 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2025-02-06 14:34:41,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 13 states have call successors, (27), 11 states have call predecessors, (27), 14 states have return successors, (29), 14 states have call predecessors, (29), 12 states have call successors, (29) [2025-02-06 14:34:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2025-02-06 14:34:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-02-06 14:34:41,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:41,035 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 72, 72, 72, 72, 72, 16, 16, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:41,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 14:34:41,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:41,235 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-02-06 14:34:41,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash 424767995, now seen corresponding path program 1 times [2025-02-06 14:34:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788302073] [2025-02-06 14:34:41,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:41,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-02-06 14:34:41,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-02-06 14:34:41,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:41,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22518 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22512 trivial. 0 not checked. [2025-02-06 14:34:42,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788302073] [2025-02-06 14:34:42,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788302073] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259179264] [2025-02-06 14:34:42,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:42,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:42,721 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:42,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 14:34:43,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-02-06 14:34:43,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-02-06 14:34:43,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:43,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:43,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 2819 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:34:43,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:43,872 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 15 treesize of output 7 [2025-02-06 14:34:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 22518 backedges. 11441 proven. 0 refuted. 0 times theorem prover too weak. 11077 trivial. 0 not checked. [2025-02-06 14:34:43,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:43,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259179264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:43,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:43,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-06 14:34:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981386423] [2025-02-06 14:34:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:43,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:43,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:43,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:43,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:34:43,886 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 14:34:47,958 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 [0] [2025-02-06 14:34:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:47,970 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2025-02-06 14:34:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:47,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 736 [2025-02-06 14:34:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:47,972 INFO L225 Difference]: With dead ends: 75 [2025-02-06 14:34:47,972 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:34:47,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 732 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:47,973 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:47,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 14:34:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:34:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:34:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:34:47,974 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 736 [2025-02-06 14:34:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:47,974 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:34:47,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 14:34:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:34:47,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:34:47,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 14:34:47,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 14:34:47,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 14:34:47,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 14:34:47,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 14:34:47,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 14:34:47,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 14:34:47,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 14:34:47,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 14:34:48,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 14:34:48,181 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:48,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:35:08,735 WARN L286 SmtUtils]: Spent 20.17s on a formula simplification. DAG size of input: 91 DAG size of output: 40 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-02-06 14:35:29,292 WARN L286 SmtUtils]: Spent 20.10s on a formula simplification. DAG size of input: 77 DAG size of output: 48 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)