./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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_5.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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:34:40,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:34:40,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:34:40,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:34:40,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:34:40,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:34:40,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:34:40,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:34:40,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:34:40,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:34:40,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:34:40,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:34:40,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:34:40,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:34:40,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:40,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:40,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:34:40,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:34:40,731 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2025-01-10 02:34:40,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:34:40,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:34:40,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:34:40,972 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:34:40,972 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:34:40,974 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_5.c [2025-01-10 02:34:42,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e986a0bff/26aecb6fa86947b894315d9559289ba3/FLAG3e8bd9507 [2025-01-10 02:34:42,338 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:34:42,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-01-10 02:34:42,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e986a0bff/26aecb6fa86947b894315d9559289ba3/FLAG3e8bd9507 [2025-01-10 02:34:42,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e986a0bff/26aecb6fa86947b894315d9559289ba3 [2025-01-10 02:34:42,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:34:42,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:34:42,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:34:42,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:34:42,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:34:42,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42, skipping insertion in model container [2025-01-10 02:34:42,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:34:42,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:34:42,838 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:34:42,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:34:42,870 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:34:42,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42 WrapperNode [2025-01-10 02:34:42,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:34:42,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:34:42,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:34:42,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:34:42,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,900 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-01-10 02:34:42,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:34:42,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:34:42,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:34:42,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:34:42,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,931 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2025-01-10 02:34:42,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:34:42,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:34:42,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:34:42,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:34:42,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:42,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:42,981 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-01-10 02:34:42,983 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-01-10 02:34:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:34:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:34:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:34:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:34:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:34:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:34:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:34:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:34:43,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-01-10 02:34:43,005 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-01-10 02:34:43,005 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-01-10 02:34:43,005 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:34:43,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:34:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:34:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:34:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:34:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:34:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-01-10 02:34:43,006 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-01-10 02:34:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-01-10 02:34:43,006 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-01-10 02:34:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:34:43,076 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:34:43,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:34:43,268 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-10 02:34:43,268 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:34:43,275 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:34:43,275 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:34:43,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:43 BoogieIcfgContainer [2025-01-10 02:34:43,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:34:43,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:34:43,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:34:43,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:34:43,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:34:42" (1/3) ... [2025-01-10 02:34:43,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78422bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:43, skipping insertion in model container [2025-01-10 02:34:43,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (2/3) ... [2025-01-10 02:34:43,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78422bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:43, skipping insertion in model container [2025-01-10 02:34:43,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:43" (3/3) ... [2025-01-10 02:34:43,281 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2025-01-10 02:34:43,292 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:34:43,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_5.c that has 6 procedures, 70 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-01-10 02:34:43,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:34:43,340 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;@3c1dc63b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:34:43,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 02:34:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 59 states have internal predecessors, (64), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:34:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 02:34:43,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:43,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:43,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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 8 more)] === [2025-01-10 02:34:43,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash -57619265, now seen corresponding path program 1 times [2025-01-10 02:34:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:43,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708952810] [2025-01-10 02:34:43,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:43,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:43,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:34:43,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:34:43,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:43,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:43,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:43,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708952810] [2025-01-10 02:34:43,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708952810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:43,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:43,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:34:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912497856] [2025-01-10 02:34:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:43,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:43,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:43,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:43,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:43,849 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 59 states have internal predecessors, (64), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 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-01-10 02:34:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,080 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2025-01-10 02:34:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:44,082 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-01-10 02:34:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,086 INFO L225 Difference]: With dead ends: 140 [2025-01-10 02:34:44,086 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 02:34:44,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-10 02:34:44,090 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:44,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 158 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:34:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 02:34:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-10 02:34:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 45 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-10 02:34:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-01-10 02:34:44,118 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 12 [2025-01-10 02:34:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:44,118 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-01-10 02:34:44,118 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-01-10 02:34:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2025-01-10 02:34:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:34:44,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:44,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:44,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:34:44,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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 8 more)] === [2025-01-10 02:34:44,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash 780750332, now seen corresponding path program 1 times [2025-01-10 02:34:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758210321] [2025-01-10 02:34:44,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:44,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:34:44,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:34:44,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758210321] [2025-01-10 02:34:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758210321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:44,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:44,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100554741] [2025-01-10 02:34:44,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:44,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:44,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:44,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:44,306 INFO L87 Difference]: Start difference. First operand 56 states and 64 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-01-10 02:34:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,359 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2025-01-10 02:34:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:44,360 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-01-10 02:34:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,361 INFO L225 Difference]: With dead ends: 66 [2025-01-10 02:34:44,361 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 02:34:44,361 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-01-10 02:34:44,361 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 274 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-01-10 02:34:44,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 274 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 02:34:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-10 02:34:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 49 states have internal predecessors, (50), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-01-10 02:34:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2025-01-10 02:34:44,369 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 15 [2025-01-10 02:34:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:44,369 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2025-01-10 02:34:44,369 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-01-10 02:34:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2025-01-10 02:34:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 02:34:44,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:44,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:44,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:34:44,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:44,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:44,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1520081603, now seen corresponding path program 1 times [2025-01-10 02:34:44,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:44,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865935891] [2025-01-10 02:34:44,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:44,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 02:34:44,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 02:34:44,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:44,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:44,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865935891] [2025-01-10 02:34:44,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865935891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:44,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:44,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:44,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730622643] [2025-01-10 02:34:44,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:44,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:44,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:44,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:44,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:44,556 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-01-10 02:34:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,613 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2025-01-10 02:34:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:44,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 18 [2025-01-10 02:34:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,615 INFO L225 Difference]: With dead ends: 126 [2025-01-10 02:34:44,616 INFO L226 Difference]: Without dead ends: 67 [2025-01-10 02:34:44,616 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-01-10 02:34:44,617 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 273 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-01-10 02:34:44,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 273 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-10 02:34:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-01-10 02:34:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.358974358974359) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-01-10 02:34:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-01-10 02:34:44,622 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 18 [2025-01-10 02:34:44,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:44,623 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-01-10 02:34:44,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-01-10 02:34:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-01-10 02:34:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 02:34:44,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:44,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:44,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:34:44,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:44,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1526395918, now seen corresponding path program 1 times [2025-01-10 02:34:44,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:44,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782285665] [2025-01-10 02:34:44,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:44,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 02:34:44,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 02:34:44,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:44,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:44,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782285665] [2025-01-10 02:34:44,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782285665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:44,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:44,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:34:44,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634049886] [2025-01-10 02:34:44,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:44,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:44,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:44,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:44,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:34:44,797 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,892 INFO L93 Difference]: Finished difference Result 135 states and 161 transitions. [2025-01-10 02:34:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:34:44,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-10 02:34:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,896 INFO L225 Difference]: With dead ends: 135 [2025-01-10 02:34:44,896 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 02:34:44,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:34:44,897 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:44,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 314 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 02:34:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-01-10 02:34:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 54 states have internal predecessors, (57), 12 states have call successors, (12), 8 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-10 02:34:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2025-01-10 02:34:44,908 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 18 [2025-01-10 02:34:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:44,908 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2025-01-10 02:34:44,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2025-01-10 02:34:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 02:34:44,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:44,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:44,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:34:44,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:44,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash -122110496, now seen corresponding path program 1 times [2025-01-10 02:34:44,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:44,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611047314] [2025-01-10 02:34:44,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:44,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 02:34:44,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 02:34:44,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:44,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611047314] [2025-01-10 02:34:44,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611047314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:44,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:44,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:34:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434386774] [2025-01-10 02:34:44,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:44,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:34:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:44,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:34:44,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:34:44,981 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,996 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2025-01-10 02:34:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:34:44,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 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 19 [2025-01-10 02:34:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,998 INFO L225 Difference]: With dead ends: 70 [2025-01-10 02:34:44,998 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 02:34:44,998 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-01-10 02:34:44,998 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 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-01-10 02:34:44,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 02:34:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-10 02:34:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.302325581395349) internal successors, (56), 53 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-10 02:34:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-01-10 02:34:45,004 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 19 [2025-01-10 02:34:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:45,004 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-01-10 02:34:45,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-01-10 02:34:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 02:34:45,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:45,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:45,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:34:45,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash 73633256, now seen corresponding path program 1 times [2025-01-10 02:34:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757830481] [2025-01-10 02:34:45,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:45,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:45,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 02:34:45,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 02:34:45,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:45,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:45,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757830481] [2025-01-10 02:34:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757830481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:45,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:45,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:34:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787291360] [2025-01-10 02:34:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:45,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:34:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:45,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:34:45,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:34:45,070 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:45,110 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2025-01-10 02:34:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:34:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-10 02:34:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:45,111 INFO L225 Difference]: With dead ends: 69 [2025-01-10 02:34:45,111 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 02:34:45,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:45,112 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:45,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 206 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 02:34:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-10 02:34:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 8 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-10 02:34:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-01-10 02:34:45,120 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2025-01-10 02:34:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:45,121 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-01-10 02:34:45,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-01-10 02:34:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:34:45,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:45,121 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] [2025-01-10 02:34:45,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:34:45,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:45,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1353591939, now seen corresponding path program 1 times [2025-01-10 02:34:45,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:45,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367807599] [2025-01-10 02:34:45,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:45,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:45,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:34:45,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:34:45,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:45,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:45,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:45,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367807599] [2025-01-10 02:34:45,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367807599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:45,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:45,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:34:45,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40193973] [2025-01-10 02:34:45,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:45,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:45,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:45,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:45,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:34:45,296 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:45,368 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-01-10 02:34:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:34:45,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-10 02:34:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:45,369 INFO L225 Difference]: With dead ends: 74 [2025-01-10 02:34:45,369 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 02:34:45,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:34:45,370 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 11 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 260 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:45,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 260 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 02:34:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2025-01-10 02:34:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.255813953488372) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-10 02:34:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-01-10 02:34:45,376 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 23 [2025-01-10 02:34:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:45,376 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-01-10 02:34:45,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-01-10 02:34:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:34:45,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:45,377 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, 1, 1, 1] [2025-01-10 02:34:45,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:34:45,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1741627569, now seen corresponding path program 1 times [2025-01-10 02:34:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285407539] [2025-01-10 02:34:45,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:45,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:34:45,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:34:45,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:45,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:34:45,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285407539] [2025-01-10 02:34:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285407539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:45,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036651199] [2025-01-10 02:34:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:45,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:45,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:45,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:45,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:45,521 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:34:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:45,589 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2025-01-10 02:34:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:45,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-01-10 02:34:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:45,590 INFO L225 Difference]: With dead ends: 85 [2025-01-10 02:34:45,590 INFO L226 Difference]: Without dead ends: 83 [2025-01-10 02:34:45,590 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-01-10 02:34:45,591 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 251 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-01-10 02:34:45,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 251 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-10 02:34:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2025-01-10 02:34:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 57 states have internal predecessors, (61), 13 states have call successors, (13), 9 states have call predecessors, (13), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-10 02:34:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-01-10 02:34:45,603 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 28 [2025-01-10 02:34:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:45,604 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-01-10 02:34:45,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:34:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-01-10 02:34:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:34:45,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:45,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:45,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:34:45,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:45,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:45,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1236543506, now seen corresponding path program 1 times [2025-01-10 02:34:45,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:45,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169403709] [2025-01-10 02:34:45,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:45,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:45,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:34:45,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:34:45,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:45,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:34:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169403709] [2025-01-10 02:34:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169403709] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632693049] [2025-01-10 02:34:45,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:45,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:45,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:45,759 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-01-10 02:34:45,760 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-01-10 02:34:45,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:34:45,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:34:45,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:45,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:45,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:34:45,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:45,906 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-01-10 02:34:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:34:45,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:45,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632693049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:45,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:45,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-01-10 02:34:45,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623786810] [2025-01-10 02:34:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:45,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:45,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:45,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:45,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:34:45,962 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:34:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:46,059 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2025-01-10 02:34:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:46,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-01-10 02:34:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:46,060 INFO L225 Difference]: With dead ends: 153 [2025-01-10 02:34:46,061 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 02:34:46,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:34:46,062 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:46,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 154 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 02:34:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-10 02:34:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.22) internal successors, (61), 57 states have internal predecessors, (61), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-10 02:34:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2025-01-10 02:34:46,075 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 29 [2025-01-10 02:34:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:46,075 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2025-01-10 02:34:46,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:34:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2025-01-10 02:34:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 02:34:46,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:46,077 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, 1, 1, 1] [2025-01-10 02:34:46,084 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-01-10 02:34:46,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:46,278 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:46,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1736963760, now seen corresponding path program 1 times [2025-01-10 02:34:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165159651] [2025-01-10 02:34:46,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:46,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 02:34:46,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 02:34:46,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:46,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:34:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165159651] [2025-01-10 02:34:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165159651] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145184371] [2025-01-10 02:34:46,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:46,688 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-01-10 02:34:46,690 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-01-10 02:34:46,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 02:34:46,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 02:34:46,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:46,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:46,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 02:34:46,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:46,814 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-01-10 02:34:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:34:47,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:34:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:34:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145184371] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:34:47,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:34:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2025-01-10 02:34:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586561612] [2025-01-10 02:34:47,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:34:47,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 02:34:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:47,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 02:34:47,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2025-01-10 02:34:47,455 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 25 states, 19 states have (on average 2.789473684210526) internal successors, (53), 22 states have internal predecessors, (53), 8 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-10 02:34:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:47,682 INFO L93 Difference]: Finished difference Result 157 states and 191 transitions. [2025-01-10 02:34:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:34:47,682 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.789473684210526) internal successors, (53), 22 states have internal predecessors, (53), 8 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) Word has length 46 [2025-01-10 02:34:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:47,683 INFO L225 Difference]: With dead ends: 157 [2025-01-10 02:34:47,683 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 02:34:47,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2025-01-10 02:34:47,684 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 33 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:47,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 394 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 02:34:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-10 02:34:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 59 states have internal predecessors, (63), 13 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 02:34:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2025-01-10 02:34:47,691 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 46 [2025-01-10 02:34:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:47,691 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2025-01-10 02:34:47,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.789473684210526) internal successors, (53), 22 states have internal predecessors, (53), 8 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-10 02:34:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2025-01-10 02:34:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 02:34:47,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:47,693 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, 1, 1, 1] [2025-01-10 02:34:47,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:34:47,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:47,893 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:47,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1421662528, now seen corresponding path program 2 times [2025-01-10 02:34:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:47,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634534400] [2025-01-10 02:34:47,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:47,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-01-10 02:34:47,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:34:47,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:47,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-10 02:34:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634534400] [2025-01-10 02:34:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634534400] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130544518] [2025-01-10 02:34:48,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:48,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:48,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:48,189 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-01-10 02:34:48,191 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-01-10 02:34:48,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-01-10 02:34:48,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:34:48,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:48,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:48,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:34:48,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:48,333 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-01-10 02:34:48,485 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-01-10 02:34:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-10 02:34:48,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130544518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:48,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:48,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-01-10 02:34:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283130546] [2025-01-10 02:34:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:48,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:48,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:48,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:34:48,499 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:34:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:48,642 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2025-01-10 02:34:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:34:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 74 [2025-01-10 02:34:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:48,644 INFO L225 Difference]: With dead ends: 85 [2025-01-10 02:34:48,644 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 02:34:48,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:34:48,645 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 57 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:48,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 228 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 02:34:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2025-01-10 02:34:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 58 states have internal predecessors, (62), 13 states have call successors, (13), 9 states have call predecessors, (13), 10 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-10 02:34:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-01-10 02:34:48,664 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 74 [2025-01-10 02:34:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:48,664 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-01-10 02:34:48,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:34:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-01-10 02:34:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 02:34:48,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:48,667 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, 1, 1, 1] [2025-01-10 02:34:48,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:34:48,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:48,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:48,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1121865326, now seen corresponding path program 1 times [2025-01-10 02:34:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488761216] [2025-01-10 02:34:48,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:48,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 02:34:48,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 02:34:48,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:48,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-10 02:34:49,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:49,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488761216] [2025-01-10 02:34:49,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488761216] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:49,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944620986] [2025-01-10 02:34:49,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:49,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:49,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:49,133 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-01-10 02:34:49,135 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-01-10 02:34:49,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 02:34:49,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 02:34:49,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:49,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:49,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:34:49,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:49,352 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-01-10 02:34:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-10 02:34:49,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944620986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-01-10 02:34:49,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437161168] [2025-01-10 02:34:49,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:49,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:49,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:49,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:34:49,364 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:34:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:49,417 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2025-01-10 02:34:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:34:49,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 75 [2025-01-10 02:34:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:49,421 INFO L225 Difference]: With dead ends: 81 [2025-01-10 02:34:49,421 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 02:34:49,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 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-01-10 02:34:49,421 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:49,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 188 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 02:34:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2025-01-10 02:34:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.183673469387755) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-01-10 02:34:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2025-01-10 02:34:49,428 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 75 [2025-01-10 02:34:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:49,429 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2025-01-10 02:34:49,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:34:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2025-01-10 02:34:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 02:34:49,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:49,430 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 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-01-10 02:34:49,436 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-01-10 02:34:49,634 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,SelfDestructingSolverStorable11 [2025-01-10 02:34:49,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:49,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:49,635 INFO L85 PathProgramCache]: Analyzing trace with hash 31260946, now seen corresponding path program 1 times [2025-01-10 02:34:49,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:49,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756075908] [2025-01-10 02:34:49,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:49,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 02:34:49,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 02:34:49,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:49,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-10 02:34:50,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:50,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756075908] [2025-01-10 02:34:50,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756075908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:50,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699541633] [2025-01-10 02:34:50,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:50,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:50,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:50,010 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-01-10 02:34:50,013 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-01-10 02:34:50,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 02:34:50,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 02:34:50,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:50,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:50,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-10 02:34:50,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:50,172 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-01-10 02:34:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-10 02:34:50,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:34:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 5 proven. 133 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-10 02:34:51,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699541633] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:34:51,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:34:51,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 21] total 39 [2025-01-10 02:34:51,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832913749] [2025-01-10 02:34:51,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:34:51,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-10 02:34:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:51,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-10 02:34:51,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 02:34:51,986 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 39 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2025-01-10 02:34:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:52,614 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2025-01-10 02:34:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 02:34:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) Word has length 97 [2025-01-10 02:34:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:52,618 INFO L225 Difference]: With dead ends: 153 [2025-01-10 02:34:52,618 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 02:34:52,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=421, Invalid=2335, Unknown=0, NotChecked=0, Total=2756 [2025-01-10 02:34:52,620 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:52,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 652 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:34:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 02:34:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 02:34:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 12 states have call successors, (12), 9 states have call predecessors, (12), 12 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2025-01-10 02:34:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2025-01-10 02:34:52,639 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 97 [2025-01-10 02:34:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:52,639 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2025-01-10 02:34:52,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2025-01-10 02:34:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2025-01-10 02:34:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 02:34:52,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:52,642 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 16, 16, 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, 1, 1, 1] [2025-01-10 02:34:52,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 02:34:52,847 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,SelfDestructingSolverStorable12 [2025-01-10 02:34:52,847 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-01-10 02:34:52,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1047018414, now seen corresponding path program 2 times [2025-01-10 02:34:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:52,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304235757] [2025-01-10 02:34:52,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:52,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 193 statements into 2 equivalence classes. [2025-01-10 02:34:52,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 02:34:52,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:52,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 19 proven. 489 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2025-01-10 02:34:54,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304235757] [2025-01-10 02:34:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304235757] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110521844] [2025-01-10 02:34:54,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:54,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:54,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:54,071 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-01-10 02:34:54,073 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-01-10 02:34:54,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 193 statements into 2 equivalence classes. [2025-01-10 02:34:54,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 02:34:54,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:54,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:54,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:34:54,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:54,280 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-01-10 02:34:54,494 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-01-10 02:34:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-01-10 02:34:54,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110521844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 21 [2025-01-10 02:34:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781487548] [2025-01-10 02:34:54,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:54,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:54,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:54,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:34:54,514 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-10 02:34:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:54,619 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2025-01-10 02:34:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:34:54,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 193 [2025-01-10 02:34:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:54,620 INFO L225 Difference]: With dead ends: 84 [2025-01-10 02:34:54,620 INFO L226 Difference]: Without dead ends: 83 [2025-01-10 02:34:54,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-01-10 02:34:54,621 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:54,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 170 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-10 02:34:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2025-01-10 02:34:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.163265306122449) internal successors, (57), 53 states have internal predecessors, (57), 11 states have call successors, (11), 9 states have call predecessors, (11), 12 states have return successors, (17), 13 states have call predecessors, (17), 9 states have call successors, (17) [2025-01-10 02:34:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2025-01-10 02:34:54,635 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 193 [2025-01-10 02:34:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:54,636 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2025-01-10 02:34:54,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-10 02:34:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2025-01-10 02:34:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-10 02:34:54,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:54,637 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:54,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 02:34:54,838 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,SelfDestructingSolverStorable13 [2025-01-10 02:34:54,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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 8 more)] === [2025-01-10 02:34:54,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:54,839 INFO L85 PathProgramCache]: Analyzing trace with hash -868668411, now seen corresponding path program 1 times [2025-01-10 02:34:54,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:54,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290510508] [2025-01-10 02:34:54,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:54,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:54,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-10 02:34:54,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-10 02:34:54,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:54,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-01-10 02:34:54,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:54,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290510508] [2025-01-10 02:34:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290510508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:54,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614261949] [2025-01-10 02:34:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:54,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:54,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:54,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:54,979 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 02:34:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:55,015 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2025-01-10 02:34:55,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:55,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 120 [2025-01-10 02:34:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:55,016 INFO L225 Difference]: With dead ends: 84 [2025-01-10 02:34:55,016 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 02:34:55,016 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-01-10 02:34:55,017 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 249 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-01-10 02:34:55,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 249 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 02:34:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-10 02:34:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 57 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 12 states have return successors, (18), 14 states have call predecessors, (18), 10 states have call successors, (18) [2025-01-10 02:34:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2025-01-10 02:34:55,024 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 120 [2025-01-10 02:34:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:55,024 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2025-01-10 02:34:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 02:34:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2025-01-10 02:34:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-10 02:34:55,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:55,026 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:55,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:34:55,026 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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 8 more)] === [2025-01-10 02:34:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash 441247813, now seen corresponding path program 1 times [2025-01-10 02:34:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120806117] [2025-01-10 02:34:55,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:55,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-10 02:34:55,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-10 02:34:55,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:55,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2025-01-10 02:34:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:55,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120806117] [2025-01-10 02:34:55,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120806117] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:55,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318288370] [2025-01-10 02:34:55,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:55,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:55,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:55,448 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-01-10 02:34:55,450 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-01-10 02:34:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-10 02:34:55,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-10 02:34:55,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:55,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:55,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 02:34:55,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:55,659 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-01-10 02:34:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 77 proven. 8 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2025-01-10 02:34:55,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:34:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 69 proven. 17 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2025-01-10 02:34:56,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318288370] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:34:56,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:34:56,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 16] total 33 [2025-01-10 02:34:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875330879] [2025-01-10 02:34:56,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:34:56,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-10 02:34:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:56,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 02:34:56,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-01-10 02:34:56,829 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 33 states, 26 states have (on average 3.0) internal successors, (78), 28 states have internal predecessors, (78), 13 states have call successors, (24), 7 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2025-01-10 02:34:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:57,304 INFO L93 Difference]: Finished difference Result 162 states and 190 transitions. [2025-01-10 02:34:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 02:34:57,305 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 3.0) internal successors, (78), 28 states have internal predecessors, (78), 13 states have call successors, (24), 7 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) Word has length 216 [2025-01-10 02:34:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:57,305 INFO L225 Difference]: With dead ends: 162 [2025-01-10 02:34:57,305 INFO L226 Difference]: Without dead ends: 86 [2025-01-10 02:34:57,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=1832, Unknown=0, NotChecked=0, Total=2162 [2025-01-10 02:34:57,307 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 48 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:57,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 323 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:34:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-10 02:34:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-10 02:34:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 14 states have return successors, (20), 16 states have call predecessors, (20), 10 states have call successors, (20) [2025-01-10 02:34:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2025-01-10 02:34:57,317 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 216 [2025-01-10 02:34:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:57,318 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2025-01-10 02:34:57,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 3.0) internal successors, (78), 28 states have internal predecessors, (78), 13 states have call successors, (24), 7 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2025-01-10 02:34:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2025-01-10 02:34:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-01-10 02:34:57,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:57,323 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 48, 48, 48, 48, 48, 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, 1, 1, 1] [2025-01-10 02:34:57,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 02:34:57,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:57,523 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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 8 more)] === [2025-01-10 02:34:57,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -853220755, now seen corresponding path program 2 times [2025-01-10 02:34:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:57,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765130627] [2025-01-10 02:34:57,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:57,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 570 statements into 2 equivalence classes. [2025-01-10 02:34:57,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 570 of 570 statements. [2025-01-10 02:34:57,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:57,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11369 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11364 trivial. 0 not checked. [2025-01-10 02:34:58,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:58,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765130627] [2025-01-10 02:34:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765130627] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111709569] [2025-01-10 02:34:58,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:58,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:58,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:58,621 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-01-10 02:34:58,622 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-01-10 02:34:58,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 570 statements into 2 equivalence classes. [2025-01-10 02:34:58,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 570 of 570 statements. [2025-01-10 02:34:58,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:58,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:58,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 2335 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:34:59,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:59,026 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-01-10 02:34:59,498 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-01-10 02:34:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11369 backedges. 5825 proven. 0 refuted. 0 times theorem prover too weak. 5544 trivial. 0 not checked. [2025-01-10 02:34:59,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:59,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111709569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:59,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:59,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2025-01-10 02:34:59,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986934271] [2025-01-10 02:34:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:59,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:59,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:59,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:59,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:34:59,519 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:34:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:59,603 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2025-01-10 02:34:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:34:59,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 570 [2025-01-10 02:34:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:59,605 INFO L225 Difference]: With dead ends: 89 [2025-01-10 02:34:59,605 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 02:34:59,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 567 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:34:59,605 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:59,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 163 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 02:34:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2025-01-10 02:34:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.125) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 14 states have return successors, (20), 16 states have call predecessors, (20), 10 states have call successors, (20) [2025-01-10 02:34:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2025-01-10 02:34:59,618 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 570 [2025-01-10 02:34:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:59,621 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2025-01-10 02:34:59,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:34:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2025-01-10 02:34:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-10 02:34:59,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:59,628 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 48, 48, 48, 48, 48, 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, 1, 1, 1] [2025-01-10 02:34:59,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:34:59,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:34:59,833 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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 8 more)] === [2025-01-10 02:34:59,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash -680039590, now seen corresponding path program 1 times [2025-01-10 02:34:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270642489] [2025-01-10 02:34:59,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:59,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:59,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-10 02:34:59,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-10 02:34:59,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:59,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11370 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11364 trivial. 0 not checked. [2025-01-10 02:35:00,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:00,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270642489] [2025-01-10 02:35:00,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270642489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:35:00,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295655933] [2025-01-10 02:35:00,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:00,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:00,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:00,810 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-01-10 02:35:00,811 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-01-10 02:35:00,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-10 02:35:01,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-10 02:35:01,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:01,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:01,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 2336 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:35:01,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:01,576 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-01-10 02:35:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11370 backedges. 5825 proven. 0 refuted. 0 times theorem prover too weak. 5545 trivial. 0 not checked. [2025-01-10 02:35:01,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:35:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295655933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:35:01,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-01-10 02:35:01,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879829990] [2025-01-10 02:35:01,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:01,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:35:01,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:01,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:35:01,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:35:01,596 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:35:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:01,663 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2025-01-10 02:35:01,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:35:01,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 571 [2025-01-10 02:35:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:01,664 INFO L225 Difference]: With dead ends: 85 [2025-01-10 02:35:01,664 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 02:35:01,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 567 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-01-10 02:35:01,665 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:01,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 173 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:35:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 02:35:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-01-10 02:35:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 11 states have call successors, (11), 10 states have call predecessors, (11), 14 states have return successors, (19), 15 states have call predecessors, (19), 9 states have call successors, (19) [2025-01-10 02:35:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2025-01-10 02:35:01,673 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 571 [2025-01-10 02:35:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:01,674 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2025-01-10 02:35:01,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:35:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2025-01-10 02:35:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-10 02:35:01,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:01,676 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 48, 48, 48, 48, 48, 16, 16, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:01,685 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-01-10 02:35:01,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:35:01,877 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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 8 more)] === [2025-01-10 02:35:01,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 905516307, now seen corresponding path program 1 times [2025-01-10 02:35:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:01,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093112592] [2025-01-10 02:35:01,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:01,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-10 02:35:01,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-10 02:35:01,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:01,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11398 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 11371 trivial. 0 not checked. [2025-01-10 02:35:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093112592] [2025-01-10 02:35:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093112592] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:35:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557719290] [2025-01-10 02:35:02,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:02,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:02,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:02,789 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-01-10 02:35:02,791 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-01-10 02:35:02,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-10 02:35:03,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-10 02:35:03,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:03,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:03,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 2502 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-10 02:35:03,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:03,172 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-01-10 02:35:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11398 backedges. 4346 proven. 15 refuted. 0 times theorem prover too weak. 7037 trivial. 0 not checked. [2025-01-10 02:35:03,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:35:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11398 backedges. 9 proven. 395 refuted. 0 times theorem prover too weak. 10994 trivial. 0 not checked. [2025-01-10 02:35:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557719290] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:35:05,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:35:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 21] total 39 [2025-01-10 02:35:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763444129] [2025-01-10 02:35:05,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:35:05,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-10 02:35:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:05,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-10 02:35:05,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 02:35:05,644 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 39 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 33 states have internal predecessors, (108), 15 states have call successors, (34), 8 states have call predecessors, (34), 12 states have return successors, (35), 14 states have call predecessors, (35), 15 states have call successors, (35) [2025-01-10 02:35:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:06,226 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2025-01-10 02:35:06,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 02:35:06,228 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 33 states have internal predecessors, (108), 15 states have call successors, (34), 8 states have call predecessors, (34), 12 states have return successors, (35), 14 states have call predecessors, (35), 15 states have call successors, (35) Word has length 593 [2025-01-10 02:35:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:06,229 INFO L225 Difference]: With dead ends: 158 [2025-01-10 02:35:06,229 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 02:35:06,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1212 GetRequests, 1159 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=453, Invalid=2517, Unknown=0, NotChecked=0, Total=2970 [2025-01-10 02:35:06,231 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 67 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:06,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 238 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:35:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 02:35:06,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-10 02:35:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 16 states have return successors, (21), 17 states have call predecessors, (21), 9 states have call successors, (21) [2025-01-10 02:35:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2025-01-10 02:35:06,240 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 593 [2025-01-10 02:35:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:06,240 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2025-01-10 02:35:06,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 33 states have internal predecessors, (108), 15 states have call successors, (34), 8 states have call predecessors, (34), 12 states have return successors, (35), 14 states have call predecessors, (35), 15 states have call successors, (35) [2025-01-10 02:35:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2025-01-10 02:35:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1492 [2025-01-10 02:35:06,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:06,250 INFO L218 NwaCegarLoop]: trace histogram [160, 160, 128, 128, 128, 128, 128, 40, 40, 32, 32, 32, 32, 32, 32, 32, 32, 32, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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-01-10 02:35:06,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 02:35:06,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:06,451 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 8 more)] === [2025-01-10 02:35:06,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1024089121, now seen corresponding path program 2 times [2025-01-10 02:35:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:06,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462905745] [2025-01-10 02:35:06,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:35:06,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:06,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1491 statements into 2 equivalence classes. [2025-01-10 02:35:06,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1491 of 1491 statements. [2025-01-10 02:35:06,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:35:06,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 81363 backedges. 10 proven. 197 refuted. 0 times theorem prover too weak. 81156 trivial. 0 not checked. [2025-01-10 02:35:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462905745] [2025-01-10 02:35:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462905745] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:35:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899729438] [2025-01-10 02:35:11,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:35:11,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:11,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:11,304 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:35:11,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 02:35:11,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1491 statements into 2 equivalence classes. [2025-01-10 02:35:12,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1491 of 1491 statements. [2025-01-10 02:35:12,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:35:12,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:12,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 5854 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:35:12,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:12,190 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-01-10 02:35:13,173 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-01-10 02:35:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 81363 backedges. 41053 proven. 0 refuted. 0 times theorem prover too weak. 40310 trivial. 0 not checked. [2025-01-10 02:35:13,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:35:13,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899729438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:13,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:35:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2025-01-10 02:35:13,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348537758] [2025-01-10 02:35:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:35:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:13,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:35:13,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-10 02:35:13,193 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-10 02:35:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:13,280 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2025-01-10 02:35:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:35:13,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 1491 [2025-01-10 02:35:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:13,283 INFO L225 Difference]: With dead ends: 85 [2025-01-10 02:35:13,283 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 02:35:13,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1511 GetRequests, 1491 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:35:13,285 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:13,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 161 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:35:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 02:35:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2025-01-10 02:35:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 11 states have call successors, (11), 10 states have call predecessors, (11), 16 states have return successors, (21), 17 states have call predecessors, (21), 9 states have call successors, (21) [2025-01-10 02:35:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2025-01-10 02:35:13,301 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 1491 [2025-01-10 02:35:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:13,302 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2025-01-10 02:35:13,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-10 02:35:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2025-01-10 02:35:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1493 [2025-01-10 02:35:13,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:13,313 INFO L218 NwaCegarLoop]: trace histogram [160, 160, 128, 128, 128, 128, 128, 40, 40, 32, 32, 32, 32, 32, 32, 32, 32, 32, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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-01-10 02:35:13,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 02:35:13,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:13,514 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 8 more)] === [2025-01-10 02:35:13,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1681991776, now seen corresponding path program 1 times [2025-01-10 02:35:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998109696] [2025-01-10 02:35:13,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:13,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1492 statements into 1 equivalence classes. [2025-01-10 02:35:13,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1492 of 1492 statements. [2025-01-10 02:35:13,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:13,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 81364 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 81358 trivial. 0 not checked. [2025-01-10 02:35:16,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998109696] [2025-01-10 02:35:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998109696] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:35:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928484811] [2025-01-10 02:35:16,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:16,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:16,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:16,774 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:35:16,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 02:35:17,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1492 statements into 1 equivalence classes. [2025-01-10 02:35:17,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1492 of 1492 statements. [2025-01-10 02:35:17,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:17,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:17,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 5855 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:35:17,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:18,413 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-01-10 02:35:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 81364 backedges. 41053 proven. 0 refuted. 0 times theorem prover too weak. 40311 trivial. 0 not checked. [2025-01-10 02:35:18,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:35:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928484811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:35:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-01-10 02:35:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698788320] [2025-01-10 02:35:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:18,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:35:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:18,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:35:18,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:35:18,426 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-10 02:35:22,485 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-01-10 02:35:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:22,490 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2025-01-10 02:35:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:35:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 1492 [2025-01-10 02:35:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:22,492 INFO L225 Difference]: With dead ends: 83 [2025-01-10 02:35:22,492 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:35:22,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1502 GetRequests, 1488 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-01-10 02:35:22,493 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:22,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 150 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-10 02:35:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:35:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:35:22,494 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-01-10 02:35:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:35:22,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1492 [2025-01-10 02:35:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:22,494 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:35:22,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-10 02:35:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:35:22,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:35:22,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-01-10 02:35:22,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 02:35:22,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 02:35:22,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 02:35:22,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 02:35:22,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 02:35:22,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 02:35:22,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 02:35:22,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 02:35:22,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-01-10 02:35:22,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 02:35:22,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:22,701 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:22,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:35:48,268 WARN L286 SmtUtils]: Spent 24.10s on a formula simplification. DAG size of input: 105 DAG size of output: 64 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)