./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-ll.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 96f1211cbeeae798f0ae4041c6e80d5023e7b1c38257b583d7afbb4e6848597b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:36:01,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:36:01,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:36:01,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:36:01,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:36:01,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:36:01,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:36:01,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:36:01,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:36:01,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:36:01,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:36:01,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:36:01,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:36:01,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:36:01,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:36:01,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:36:01,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:36:01,101 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 -> 96f1211cbeeae798f0ae4041c6e80d5023e7b1c38257b583d7afbb4e6848597b [2025-02-06 14:36:01,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:36:01,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:36:01,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:36:01,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:36:01,350 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:36:01,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-ll.c [2025-02-06 14:36:02,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96dd21bbd/1bccf03c0678477cb9fe9815a6cd12f2/FLAG638305932 [2025-02-06 14:36:02,681 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:36:02,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_prod4br-ll.c [2025-02-06 14:36:02,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96dd21bbd/1bccf03c0678477cb9fe9815a6cd12f2/FLAG638305932 [2025-02-06 14:36:02,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96dd21bbd/1bccf03c0678477cb9fe9815a6cd12f2 [2025-02-06 14:36:02,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:36:02,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:36:02,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:36:02,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:36:02,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:36:02,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02, skipping insertion in model container [2025-02-06 14:36:02,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:36:02,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:36:02,855 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:36:02,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:36:02,888 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:36:02,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02 WrapperNode [2025-02-06 14:36:02,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:36:02,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:36:02,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:36:02,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:36:02,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,914 INFO L138 Inliner]: procedures = 16, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2025-02-06 14:36:02,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:36:02,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:36:02,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:36:02,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:36:02,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,945 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 15, 7, 9, 15, 4, 5]. 26 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 16 writes are split as follows [0, 4, 2, 4, 4, 1, 1]. [2025-02-06 14:36:02,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:36:02,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:36:02,970 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:36:02,970 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:36:02,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (1/1) ... [2025-02-06 14:36:02,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:36:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:03,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:36:03,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:36:03,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:36:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:36:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 14:36:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 14:36:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 14:36:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 14:36:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 14:36:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 14:36:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 14:36:03,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 14:36:03,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 14:36:03,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 14:36:03,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 14:36:03,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 14:36:03,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 14:36:03,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 14:36:03,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:36:03,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:36:03,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 14:36:03,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 14:36:03,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 14:36:03,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 14:36:03,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 14:36:03,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 14:36:03,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 14:36:03,033 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_51_0 [2025-02-06 14:36:03,033 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_51_0 [2025-02-06 14:36:03,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:36:03,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:36:03,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 14:36:03,131 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:36:03,132 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:36:03,240 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#p~0#1.base, main_~#p~0#1.offset);havoc main_~#p~0#1.base, main_~#p~0#1.offset;call ULTIMATE.dealloc(main_~#q~0#1.base, main_~#q~0#1.offset);havoc main_~#q~0#1.base, main_~#q~0#1.offset; [2025-02-06 14:36:03,425 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-02-06 14:36:03,425 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:36:03,434 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:36:03,436 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:36:03,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:03 BoogieIcfgContainer [2025-02-06 14:36:03,436 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:36:03,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:36:03,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:36:03,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:36:03,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:36:02" (1/3) ... [2025-02-06 14:36:03,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f18c108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:03, skipping insertion in model container [2025-02-06 14:36:03,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:02" (2/3) ... [2025-02-06 14:36:03,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f18c108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:03, skipping insertion in model container [2025-02-06 14:36:03,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:03" (3/3) ... [2025-02-06 14:36:03,445 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_prod4br-ll.c [2025-02-06 14:36:03,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:36:03,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_prod4br-ll.c that has 3 procedures, 118 locations, 1 initial locations, 0 loop locations, and 42 error locations. [2025-02-06 14:36:03,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:36:03,513 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;@1d5482c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:36:03,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-02-06 14:36:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 111 states have internal predecessors, (121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:36:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:36:03,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:03,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:03,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_0_to_51_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:03,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1537166290, now seen corresponding path program 1 times [2025-02-06 14:36:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:03,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113729472] [2025-02-06 14:36:03,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:03,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:36:03,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:36:03,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:03,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:03,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:03,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113729472] [2025-02-06 14:36:03,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113729472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:03,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:03,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:36:03,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774548789] [2025-02-06 14:36:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:03,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 14:36:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:03,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 14:36:03,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:36:03,704 INFO L87 Difference]: Start difference. First operand has 118 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 111 states have internal predecessors, (121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:03,725 INFO L93 Difference]: Finished difference Result 232 states and 262 transitions. [2025-02-06 14:36:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 14:36:03,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 14:36:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:03,730 INFO L225 Difference]: With dead ends: 232 [2025-02-06 14:36:03,730 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 14:36:03,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:36:03,734 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:03,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:36:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 14:36:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-06 14:36:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 105 states have internal predecessors, (112), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 14:36:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2025-02-06 14:36:03,766 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 8 [2025-02-06 14:36:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:03,766 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2025-02-06 14:36:03,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2025-02-06 14:36:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:36:03,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:03,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:03,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:36:03,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_0_to_51_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:03,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:03,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1565795441, now seen corresponding path program 1 times [2025-02-06 14:36:03,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:03,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393047740] [2025-02-06 14:36:03,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:03,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:03,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:36:03,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:36:03,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:03,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:03,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626210280] [2025-02-06 14:36:03,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:03,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:03,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:03,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:03,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:36:03,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:36:03,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:36:03,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:03,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:03,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 14:36:03,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:04,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:04,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:04,094 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 30 treesize of output 18 [2025-02-06 14:36:04,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:04,103 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 25 treesize of output 17 [2025-02-06 14:36:04,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:04,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 14:36:04,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 22 treesize of output 10 [2025-02-06 14:36:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:04,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:04,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393047740] [2025-02-06 14:36:04,188 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626210280] [2025-02-06 14:36:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626210280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:04,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:04,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:36:04,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297655128] [2025-02-06 14:36:04,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:04,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:36:04,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:04,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:36:04,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:36:04,190 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:04,444 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2025-02-06 14:36:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:04,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 14:36:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:04,446 INFO L225 Difference]: With dead ends: 164 [2025-02-06 14:36:04,446 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 14:36:04,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:36:04,447 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 109 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:04,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 599 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:36:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 14:36:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 127. [2025-02-06 14:36:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7532467532467533) internal successors, (135), 119 states have internal predecessors, (135), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 14:36:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2025-02-06 14:36:04,456 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 8 [2025-02-06 14:36:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:04,456 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2025-02-06 14:36:04,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2025-02-06 14:36:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 14:36:04,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:04,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:04,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 14:36:04,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:04,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_0_to_51_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:04,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1295018501, now seen corresponding path program 1 times [2025-02-06 14:36:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410661273] [2025-02-06 14:36:04,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:04,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 14:36:04,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 14:36:04,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:04,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:04,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987972689] [2025-02-06 14:36:04,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:04,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:04,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:04,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:04,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:36:04,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 14:36:04,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 14:36:04,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:04,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:04,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 14:36:04,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:04,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:04,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:04,844 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 23 treesize of output 15 [2025-02-06 14:36:04,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:04,853 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 30 treesize of output 18 [2025-02-06 14:36:04,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:04,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:36:04,945 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 22 treesize of output 10 [2025-02-06 14:36:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:04,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410661273] [2025-02-06 14:36:04,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987972689] [2025-02-06 14:36:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987972689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:04,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:04,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:36:04,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658962862] [2025-02-06 14:36:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:04,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:36:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:04,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:36:04,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:36:04,995 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:05,219 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2025-02-06 14:36:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 14:36:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:05,220 INFO L225 Difference]: With dead ends: 163 [2025-02-06 14:36:05,220 INFO L226 Difference]: Without dead ends: 162 [2025-02-06 14:36:05,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:36:05,221 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 106 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:05,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 603 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:36:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-06 14:36:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2025-02-06 14:36:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 119 states have internal predecessors, (134), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 14:36:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2025-02-06 14:36:05,228 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 9 [2025-02-06 14:36:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:05,228 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2025-02-06 14:36:05,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2025-02-06 14:36:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 14:36:05,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:05,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:05,236 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-02-06 14:36:05,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:05,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_0_to_51_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:05,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1490867951, now seen corresponding path program 1 times [2025-02-06 14:36:05,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:05,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179338167] [2025-02-06 14:36:05,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:05,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:05,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 14:36:05,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 14:36:05,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:05,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:05,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767412157] [2025-02-06 14:36:05,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:05,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:05,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:05,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:05,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:36:05,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 14:36:05,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 14:36:05,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:05,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:05,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-06 14:36:05,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:05,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:05,547 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 11 [2025-02-06 14:36:05,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:05,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:36:05,552 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 11 [2025-02-06 14:36:05,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:05,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 14:36:05,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 14:36:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:05,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179338167] [2025-02-06 14:36:05,641 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:05,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767412157] [2025-02-06 14:36:05,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767412157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:05,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179516106] [2025-02-06 14:36:05,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:05,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:05,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:05,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:05,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:05,642 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:05,837 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2025-02-06 14:36:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:36:05,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 14:36:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:05,840 INFO L225 Difference]: With dead ends: 231 [2025-02-06 14:36:05,840 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 14:36:05,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:05,841 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 203 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:05,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 609 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:36:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 14:36:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 176. [2025-02-06 14:36:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 122 states have (on average 1.778688524590164) internal successors, (217), 165 states have internal predecessors, (217), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-06 14:36:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 235 transitions. [2025-02-06 14:36:05,850 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 235 transitions. Word has length 10 [2025-02-06 14:36:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 235 transitions. [2025-02-06 14:36:05,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 235 transitions. [2025-02-06 14:36:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 14:36:05,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:05,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:05,857 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-02-06 14:36:06,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:06,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_0_to_51_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:06,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1027733693, now seen corresponding path program 1 times [2025-02-06 14:36:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229468360] [2025-02-06 14:36:06,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:06,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 14:36:06,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 14:36:06,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:06,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:06,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485473938] [2025-02-06 14:36:06,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:06,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:06,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:06,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:06,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:36:06,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 14:36:06,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 14:36:06,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:06,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:06,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-06 14:36:06,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:06,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:06,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:06,218 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 23 treesize of output 15 [2025-02-06 14:36:06,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:06,224 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 30 treesize of output 18 [2025-02-06 14:36:06,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:06,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:36:06,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:36:06,290 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 22 treesize of output 10 [2025-02-06 14:36:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:06,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:06,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229468360] [2025-02-06 14:36:06,333 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:06,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485473938] [2025-02-06 14:36:06,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485473938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:06,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:06,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:36:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250659767] [2025-02-06 14:36:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:06,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 14:36:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:06,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 14:36:06,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:36:06,334 INFO L87 Difference]: Start difference. First operand 176 states and 235 transitions. Second operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:06,618 INFO L93 Difference]: Finished difference Result 210 states and 271 transitions. [2025-02-06 14:36:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:36:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 14:36:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:06,619 INFO L225 Difference]: With dead ends: 210 [2025-02-06 14:36:06,620 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 14:36:06,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:36:06,621 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 109 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:06,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 681 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:36:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 14:36:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 176. [2025-02-06 14:36:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 122 states have (on average 1.7704918032786885) internal successors, (216), 165 states have internal predecessors, (216), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-06 14:36:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 234 transitions. [2025-02-06 14:36:06,640 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 234 transitions. Word has length 11 [2025-02-06 14:36:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:06,640 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 234 transitions. [2025-02-06 14:36:06,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 234 transitions. [2025-02-06 14:36:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:36:06,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:06,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:06,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:36:06,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:06,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_0_to_51_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:06,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:06,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1794973331, now seen corresponding path program 1 times [2025-02-06 14:36:06,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:06,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652165105] [2025-02-06 14:36:06,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:36:06,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:36:06,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:06,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:07,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:07,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652165105] [2025-02-06 14:36:07,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652165105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:07,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:07,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:07,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185396295] [2025-02-06 14:36:07,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:07,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:07,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:07,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:07,121 INFO L87 Difference]: Start difference. First operand 176 states and 234 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:07,410 INFO L93 Difference]: Finished difference Result 300 states and 399 transitions. [2025-02-06 14:36:07,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:36:07,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 14:36:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:07,412 INFO L225 Difference]: With dead ends: 300 [2025-02-06 14:36:07,412 INFO L226 Difference]: Without dead ends: 299 [2025-02-06 14:36:07,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:07,413 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 200 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:07,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 521 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:36:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-06 14:36:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 205. [2025-02-06 14:36:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.7619047619047619) internal successors, (259), 191 states have internal predecessors, (259), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (16), 9 states have call predecessors, (16), 9 states have call successors, (16) [2025-02-06 14:36:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 284 transitions. [2025-02-06 14:36:07,428 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 284 transitions. Word has length 12 [2025-02-06 14:36:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:07,428 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 284 transitions. [2025-02-06 14:36:07,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 284 transitions. [2025-02-06 14:36:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 14:36:07,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:07,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:07,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:36:07,433 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_0_to_51_0Err32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:07,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 190401665, now seen corresponding path program 1 times [2025-02-06 14:36:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:07,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520875947] [2025-02-06 14:36:07,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:07,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:07,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 14:36:07,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 14:36:07,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:07,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:07,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:07,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520875947] [2025-02-06 14:36:07,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520875947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:07,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:07,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:07,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478749751] [2025-02-06 14:36:07,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:07,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:07,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:07,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:07,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:07,703 INFO L87 Difference]: Start difference. First operand 205 states and 284 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:07,894 INFO L93 Difference]: Finished difference Result 299 states and 397 transitions. [2025-02-06 14:36:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:36:07,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 14:36:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:07,899 INFO L225 Difference]: With dead ends: 299 [2025-02-06 14:36:07,899 INFO L226 Difference]: Without dead ends: 298 [2025-02-06 14:36:07,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:07,899 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 196 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:07,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 523 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-06 14:36:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 205. [2025-02-06 14:36:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.748299319727891) internal successors, (257), 191 states have internal predecessors, (257), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (16), 9 states have call predecessors, (16), 9 states have call successors, (16) [2025-02-06 14:36:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 282 transitions. [2025-02-06 14:36:07,914 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 282 transitions. Word has length 13 [2025-02-06 14:36:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:07,914 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 282 transitions. [2025-02-06 14:36:07,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 282 transitions. [2025-02-06 14:36:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 14:36:07,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:07,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:07,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:36:07,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_0_to_51_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:07,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1607484395, now seen corresponding path program 1 times [2025-02-06 14:36:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:07,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611491411] [2025-02-06 14:36:07,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:07,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 14:36:07,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 14:36:07,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:07,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233297999] [2025-02-06 14:36:07,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:07,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:07,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:36:08,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 14:36:08,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 14:36:08,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:08,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:08,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-06 14:36:08,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:08,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:08,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:08,046 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 11 [2025-02-06 14:36:08,051 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 11 [2025-02-06 14:36:08,097 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 19 treesize of output 11 [2025-02-06 14:36:08,100 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 19 treesize of output 11 [2025-02-06 14:36:08,130 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 23 treesize of output 15 [2025-02-06 14:36:08,133 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 19 treesize of output 11 [2025-02-06 14:36:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:08,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:08,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611491411] [2025-02-06 14:36:08,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:08,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233297999] [2025-02-06 14:36:08,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233297999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:08,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:08,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:36:08,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041859628] [2025-02-06 14:36:08,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:08,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:36:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:08,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:36:08,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:36:08,143 INFO L87 Difference]: Start difference. First operand 205 states and 282 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:08,404 INFO L93 Difference]: Finished difference Result 280 states and 362 transitions. [2025-02-06 14:36:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 14:36:08,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 14:36:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:08,407 INFO L225 Difference]: With dead ends: 280 [2025-02-06 14:36:08,407 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 14:36:08,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:36:08,407 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 176 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:08,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 627 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:36:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 14:36:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 241. [2025-02-06 14:36:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 181 states have (on average 1.7900552486187846) internal successors, (324), 227 states have internal predecessors, (324), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (19), 10 states have call predecessors, (19), 11 states have call successors, (19) [2025-02-06 14:36:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 354 transitions. [2025-02-06 14:36:08,416 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 354 transitions. Word has length 14 [2025-02-06 14:36:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:08,416 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 354 transitions. [2025-02-06 14:36:08,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 354 transitions. [2025-02-06 14:36:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:36:08,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:08,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:08,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 14:36:08,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:08,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_0_to_51_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:08,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1707591233, now seen corresponding path program 1 times [2025-02-06 14:36:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:08,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465156142] [2025-02-06 14:36:08,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:08,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:36:08,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:36:08,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:08,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:08,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119705599] [2025-02-06 14:36:08,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:08,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:08,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:08,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:08,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:36:08,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:36:08,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:36:08,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:08,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:08,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-06 14:36:08,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:08,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:08,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:08,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:08,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:08,753 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 11 [2025-02-06 14:36:08,807 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 19 treesize of output 11 [2025-02-06 14:36:08,817 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 19 treesize of output 11 [2025-02-06 14:36:08,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:36:08,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:36:08,968 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 22 treesize of output 10 [2025-02-06 14:36:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:09,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:09,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:09,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465156142] [2025-02-06 14:36:09,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:09,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119705599] [2025-02-06 14:36:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119705599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:09,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:09,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 14:36:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748968670] [2025-02-06 14:36:09,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:09,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 14:36:09,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:09,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 14:36:09,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:36:09,049 INFO L87 Difference]: Start difference. First operand 241 states and 354 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:09,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:09,532 INFO L93 Difference]: Finished difference Result 275 states and 357 transitions. [2025-02-06 14:36:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:36:09,533 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 14:36:09,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:09,534 INFO L225 Difference]: With dead ends: 275 [2025-02-06 14:36:09,534 INFO L226 Difference]: Without dead ends: 274 [2025-02-06 14:36:09,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:36:09,535 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 175 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:09,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 866 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:36:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-06 14:36:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 241. [2025-02-06 14:36:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 181 states have (on average 1.7845303867403315) internal successors, (323), 227 states have internal predecessors, (323), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (19), 10 states have call predecessors, (19), 11 states have call successors, (19) [2025-02-06 14:36:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 353 transitions. [2025-02-06 14:36:09,543 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 353 transitions. Word has length 15 [2025-02-06 14:36:09,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:09,544 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 353 transitions. [2025-02-06 14:36:09,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:36:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 353 transitions. [2025-02-06 14:36:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 14:36:09,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:09,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:09,551 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-02-06 14:36:09,749 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,SelfDestructingSolverStorable8 [2025-02-06 14:36:09,749 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_0_to_51_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:09,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1369345293, now seen corresponding path program 1 times [2025-02-06 14:36:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509128906] [2025-02-06 14:36:09,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:09,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 14:36:09,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 14:36:09,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:09,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509128906] [2025-02-06 14:36:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509128906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:10,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:10,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467654992] [2025-02-06 14:36:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:10,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:10,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:10,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:10,016 INFO L87 Difference]: Start difference. First operand 241 states and 353 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:10,145 INFO L93 Difference]: Finished difference Result 353 states and 512 transitions. [2025-02-06 14:36:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:10,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 26 [2025-02-06 14:36:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:10,147 INFO L225 Difference]: With dead ends: 353 [2025-02-06 14:36:10,148 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 14:36:10,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:10,148 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 122 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:10,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 588 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 14:36:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 310. [2025-02-06 14:36:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 241 states have (on average 1.7800829875518671) internal successors, (429), 290 states have internal predecessors, (429), 16 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (36), 14 states have call predecessors, (36), 16 states have call successors, (36) [2025-02-06 14:36:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 481 transitions. [2025-02-06 14:36:10,166 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 481 transitions. Word has length 26 [2025-02-06 14:36:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:10,166 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 481 transitions. [2025-02-06 14:36:10,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 481 transitions. [2025-02-06 14:36:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:36:10,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:10,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:10,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:36:10,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:10,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -500857447, now seen corresponding path program 1 times [2025-02-06 14:36:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:10,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463515199] [2025-02-06 14:36:10,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:10,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:36:10,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:36:10,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:10,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:10,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463515199] [2025-02-06 14:36:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463515199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:10,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 14:36:10,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906864956] [2025-02-06 14:36:10,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:10,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 14:36:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:10,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 14:36:10,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:36:10,438 INFO L87 Difference]: Start difference. First operand 310 states and 481 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:36:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:10,565 INFO L93 Difference]: Finished difference Result 361 states and 580 transitions. [2025-02-06 14:36:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:36:10,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-06 14:36:10,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:10,567 INFO L225 Difference]: With dead ends: 361 [2025-02-06 14:36:10,567 INFO L226 Difference]: Without dead ends: 344 [2025-02-06 14:36:10,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:36:10,568 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 67 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:10,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 443 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-06 14:36:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 322. [2025-02-06 14:36:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 247 states have (on average 1.7692307692307692) internal successors, (437), 301 states have internal predecessors, (437), 19 states have call successors, (19), 7 states have call predecessors, (19), 14 states have return successors, (61), 16 states have call predecessors, (61), 19 states have call successors, (61) [2025-02-06 14:36:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 517 transitions. [2025-02-06 14:36:10,606 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 517 transitions. Word has length 27 [2025-02-06 14:36:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:10,606 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 517 transitions. [2025-02-06 14:36:10,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:36:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 517 transitions. [2025-02-06 14:36:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:36:10,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:10,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:10,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:36:10,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_0_to_51_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:10,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -499968875, now seen corresponding path program 1 times [2025-02-06 14:36:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:10,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742086160] [2025-02-06 14:36:10,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:10,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:36:10,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:36:10,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:10,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:10,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:10,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742086160] [2025-02-06 14:36:10,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742086160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:10,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:10,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:10,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292166283] [2025-02-06 14:36:10,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:10,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:10,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:10,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:10,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:10,783 INFO L87 Difference]: Start difference. First operand 322 states and 517 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:10,895 INFO L93 Difference]: Finished difference Result 364 states and 545 transitions. [2025-02-06 14:36:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 27 [2025-02-06 14:36:10,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:10,897 INFO L225 Difference]: With dead ends: 364 [2025-02-06 14:36:10,897 INFO L226 Difference]: Without dead ends: 363 [2025-02-06 14:36:10,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:10,898 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 119 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:10,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 591 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-06 14:36:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 322. [2025-02-06 14:36:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 247 states have (on average 1.757085020242915) internal successors, (434), 301 states have internal predecessors, (434), 19 states have call successors, (19), 7 states have call predecessors, (19), 14 states have return successors, (61), 16 states have call predecessors, (61), 19 states have call successors, (61) [2025-02-06 14:36:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 514 transitions. [2025-02-06 14:36:10,912 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 514 transitions. Word has length 27 [2025-02-06 14:36:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:10,913 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 514 transitions. [2025-02-06 14:36:10,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 514 transitions. [2025-02-06 14:36:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 14:36:10,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:10,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:10,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:36:10,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:10,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash -472228296, now seen corresponding path program 1 times [2025-02-06 14:36:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141030959] [2025-02-06 14:36:10,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:10,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:36:10,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:36:10,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:10,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:10,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177451038] [2025-02-06 14:36:10,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:10,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:10,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:10,946 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:10,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 14:36:11,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 14:36:11,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 14:36:11,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:11,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:11,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 14:36:11,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:11,037 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 11 [2025-02-06 14:36:11,043 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 11 treesize of output 7 [2025-02-06 14:36:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:11,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141030959] [2025-02-06 14:36:11,140 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177451038] [2025-02-06 14:36:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177451038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:36:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912769601] [2025-02-06 14:36:11,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:11,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 14:36:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:11,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 14:36:11,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:36:11,142 INFO L87 Difference]: Start difference. First operand 322 states and 514 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:36:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:11,317 INFO L93 Difference]: Finished difference Result 662 states and 1155 transitions. [2025-02-06 14:36:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:36:11,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-06 14:36:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:11,319 INFO L225 Difference]: With dead ends: 662 [2025-02-06 14:36:11,319 INFO L226 Difference]: Without dead ends: 360 [2025-02-06 14:36:11,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:36:11,322 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 55 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:11,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 544 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-06 14:36:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 351. [2025-02-06 14:36:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 263 states have (on average 1.6996197718631179) internal successors, (447), 321 states have internal predecessors, (447), 22 states have call successors, (22), 7 states have call predecessors, (22), 24 states have return successors, (113), 24 states have call predecessors, (113), 22 states have call successors, (113) [2025-02-06 14:36:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 582 transitions. [2025-02-06 14:36:11,341 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 582 transitions. Word has length 27 [2025-02-06 14:36:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:11,341 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 582 transitions. [2025-02-06 14:36:11,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:36:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 582 transitions. [2025-02-06 14:36:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 14:36:11,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:11,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:11,348 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-02-06 14:36:11,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:11,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_0_to_51_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:11,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1680834059, now seen corresponding path program 1 times [2025-02-06 14:36:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:11,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453227913] [2025-02-06 14:36:11,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:11,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 14:36:11,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 14:36:11,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:11,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453227913] [2025-02-06 14:36:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453227913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:11,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:11,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796075973] [2025-02-06 14:36:11,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:11,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:11,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:11,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:11,731 INFO L87 Difference]: Start difference. First operand 351 states and 582 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:11,859 INFO L93 Difference]: Finished difference Result 483 states and 781 transitions. [2025-02-06 14:36:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:11,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 28 [2025-02-06 14:36:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:11,862 INFO L225 Difference]: With dead ends: 483 [2025-02-06 14:36:11,862 INFO L226 Difference]: Without dead ends: 478 [2025-02-06 14:36:11,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:11,862 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 126 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:11,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 591 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-06 14:36:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 424. [2025-02-06 14:36:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 325 states have (on average 1.6984615384615385) internal successors, (552), 387 states have internal predecessors, (552), 27 states have call successors, (27), 9 states have call predecessors, (27), 30 states have return successors, (143), 29 states have call predecessors, (143), 27 states have call successors, (143) [2025-02-06 14:36:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 722 transitions. [2025-02-06 14:36:11,885 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 722 transitions. Word has length 28 [2025-02-06 14:36:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:11,885 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 722 transitions. [2025-02-06 14:36:11,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 722 transitions. [2025-02-06 14:36:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 14:36:11,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:11,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:11,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:36:11,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_0_to_51_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:11,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1682587467, now seen corresponding path program 1 times [2025-02-06 14:36:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:11,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821272864] [2025-02-06 14:36:11,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:11,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 14:36:11,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 14:36:11,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:11,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821272864] [2025-02-06 14:36:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821272864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:12,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:12,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618004333] [2025-02-06 14:36:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:12,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:12,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:12,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:12,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:12,066 INFO L87 Difference]: Start difference. First operand 424 states and 722 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:12,202 INFO L93 Difference]: Finished difference Result 458 states and 744 transitions. [2025-02-06 14:36:12,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:12,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 28 [2025-02-06 14:36:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:12,204 INFO L225 Difference]: With dead ends: 458 [2025-02-06 14:36:12,204 INFO L226 Difference]: Without dead ends: 457 [2025-02-06 14:36:12,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:12,205 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 96 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:12,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 618 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-02-06 14:36:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 425. [2025-02-06 14:36:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 326 states have (on average 1.6932515337423313) internal successors, (552), 388 states have internal predecessors, (552), 27 states have call successors, (27), 9 states have call predecessors, (27), 30 states have return successors, (143), 29 states have call predecessors, (143), 27 states have call successors, (143) [2025-02-06 14:36:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 722 transitions. [2025-02-06 14:36:12,232 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 722 transitions. Word has length 28 [2025-02-06 14:36:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:12,232 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 722 transitions. [2025-02-06 14:36:12,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 722 transitions. [2025-02-06 14:36:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 14:36:12,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:12,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:12,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:36:12,233 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_0_to_51_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:12,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash 566248275, now seen corresponding path program 1 times [2025-02-06 14:36:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473641449] [2025-02-06 14:36:12,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:12,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:36:12,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:36:12,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:12,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:12,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:12,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473641449] [2025-02-06 14:36:12,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473641449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:12,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:12,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019363692] [2025-02-06 14:36:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:12,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:12,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:12,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:12,400 INFO L87 Difference]: Start difference. First operand 425 states and 722 transitions. Second operand has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:12,521 INFO L93 Difference]: Finished difference Result 479 states and 772 transitions. [2025-02-06 14:36:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:12,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 29 [2025-02-06 14:36:12,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:12,523 INFO L225 Difference]: With dead ends: 479 [2025-02-06 14:36:12,523 INFO L226 Difference]: Without dead ends: 478 [2025-02-06 14:36:12,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:12,524 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 123 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:12,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 594 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-06 14:36:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 425. [2025-02-06 14:36:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 326 states have (on average 1.6840490797546013) internal successors, (549), 388 states have internal predecessors, (549), 27 states have call successors, (27), 9 states have call predecessors, (27), 30 states have return successors, (143), 29 states have call predecessors, (143), 27 states have call successors, (143) [2025-02-06 14:36:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 719 transitions. [2025-02-06 14:36:12,545 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 719 transitions. Word has length 29 [2025-02-06 14:36:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:12,545 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 719 transitions. [2025-02-06 14:36:12,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 719 transitions. [2025-02-06 14:36:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 14:36:12,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:12,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:12,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 14:36:12,546 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_0_to_51_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:12,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:12,546 INFO L85 PathProgramCache]: Analyzing trace with hash 620603940, now seen corresponding path program 1 times [2025-02-06 14:36:12,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:12,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135012314] [2025-02-06 14:36:12,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:12,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:12,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:36:12,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:36:12,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:12,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:12,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135012314] [2025-02-06 14:36:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135012314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:12,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:12,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321281043] [2025-02-06 14:36:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:12,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:12,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:12,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:12,672 INFO L87 Difference]: Start difference. First operand 425 states and 719 transitions. Second operand has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:12,807 INFO L93 Difference]: Finished difference Result 514 states and 836 transitions. [2025-02-06 14:36:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:12,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 29 [2025-02-06 14:36:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:12,810 INFO L225 Difference]: With dead ends: 514 [2025-02-06 14:36:12,810 INFO L226 Difference]: Without dead ends: 513 [2025-02-06 14:36:12,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:12,810 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 115 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:12,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 616 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-02-06 14:36:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 472. [2025-02-06 14:36:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 364 states have (on average 1.6785714285714286) internal successors, (611), 429 states have internal predecessors, (611), 30 states have call successors, (30), 10 states have call predecessors, (30), 36 states have return successors, (166), 34 states have call predecessors, (166), 30 states have call successors, (166) [2025-02-06 14:36:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 807 transitions. [2025-02-06 14:36:12,835 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 807 transitions. Word has length 29 [2025-02-06 14:36:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:12,836 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 807 transitions. [2025-02-06 14:36:12,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 807 transitions. [2025-02-06 14:36:12,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 14:36:12,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:12,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 14:36:12,837 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_0_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:12,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash 373827337, now seen corresponding path program 1 times [2025-02-06 14:36:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:12,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400178793] [2025-02-06 14:36:12,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:12,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:36:12,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:36:12,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:12,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400178793] [2025-02-06 14:36:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400178793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:12,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:36:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467064538] [2025-02-06 14:36:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:36:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:12,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:36:12,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:36:12,934 INFO L87 Difference]: Start difference. First operand 472 states and 807 transitions. Second operand has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:13,021 INFO L93 Difference]: Finished difference Result 542 states and 854 transitions. [2025-02-06 14:36:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:36:13,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2025-02-06 14:36:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:13,024 INFO L225 Difference]: With dead ends: 542 [2025-02-06 14:36:13,024 INFO L226 Difference]: Without dead ends: 540 [2025-02-06 14:36:13,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:36:13,025 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 175 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:13,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 561 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-06 14:36:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 490. [2025-02-06 14:36:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 382 states have (on average 1.662303664921466) internal successors, (635), 447 states have internal predecessors, (635), 30 states have call successors, (30), 10 states have call predecessors, (30), 36 states have return successors, (166), 34 states have call predecessors, (166), 30 states have call successors, (166) [2025-02-06 14:36:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 831 transitions. [2025-02-06 14:36:13,049 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 831 transitions. Word has length 30 [2025-02-06 14:36:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:13,050 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 831 transitions. [2025-02-06 14:36:13,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 831 transitions. [2025-02-06 14:36:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 14:36:13,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:13,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:13,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 14:36:13,050 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_0_to_51_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:13,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2058852969, now seen corresponding path program 1 times [2025-02-06 14:36:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:13,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858706814] [2025-02-06 14:36:13,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:13,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:36:13,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:36:13,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:13,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:13,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:13,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858706814] [2025-02-06 14:36:13,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858706814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:13,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:13,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:36:13,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950109653] [2025-02-06 14:36:13,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:13,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:36:13,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:13,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:36:13,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:36:13,279 INFO L87 Difference]: Start difference. First operand 490 states and 831 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:13,341 INFO L93 Difference]: Finished difference Result 1025 states and 1961 transitions. [2025-02-06 14:36:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:36:13,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 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 30 [2025-02-06 14:36:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:13,345 INFO L225 Difference]: With dead ends: 1025 [2025-02-06 14:36:13,345 INFO L226 Difference]: Without dead ends: 594 [2025-02-06 14:36:13,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:36:13,348 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 54 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:13,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 321 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:36:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-02-06 14:36:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 511. [2025-02-06 14:36:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 403 states have (on average 1.650124069478908) internal successors, (665), 468 states have internal predecessors, (665), 30 states have call successors, (30), 10 states have call predecessors, (30), 36 states have return successors, (166), 34 states have call predecessors, (166), 30 states have call successors, (166) [2025-02-06 14:36:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 861 transitions. [2025-02-06 14:36:13,394 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 861 transitions. Word has length 30 [2025-02-06 14:36:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:13,394 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 861 transitions. [2025-02-06 14:36:13,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 861 transitions. [2025-02-06 14:36:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 14:36:13,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:13,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:13,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 14:36:13,395 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_0_to_51_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:13,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2061038666, now seen corresponding path program 1 times [2025-02-06 14:36:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20206412] [2025-02-06 14:36:13,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:13,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:36:13,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:36:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:13,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:13,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:13,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20206412] [2025-02-06 14:36:13,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20206412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:13,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:13,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:13,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910987058] [2025-02-06 14:36:13,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:13,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:13,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:13,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:13,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:13,558 INFO L87 Difference]: Start difference. First operand 511 states and 861 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:13,711 INFO L93 Difference]: Finished difference Result 540 states and 878 transitions. [2025-02-06 14:36:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:13,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 30 [2025-02-06 14:36:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:13,714 INFO L225 Difference]: With dead ends: 540 [2025-02-06 14:36:13,714 INFO L226 Difference]: Without dead ends: 539 [2025-02-06 14:36:13,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:13,715 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 90 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:13,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 618 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-02-06 14:36:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 512. [2025-02-06 14:36:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 404 states have (on average 1.646039603960396) internal successors, (665), 469 states have internal predecessors, (665), 30 states have call successors, (30), 10 states have call predecessors, (30), 36 states have return successors, (166), 34 states have call predecessors, (166), 30 states have call successors, (166) [2025-02-06 14:36:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 861 transitions. [2025-02-06 14:36:13,745 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 861 transitions. Word has length 30 [2025-02-06 14:36:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:13,746 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 861 transitions. [2025-02-06 14:36:13,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 861 transitions. [2025-02-06 14:36:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 14:36:13,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:13,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:13,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 14:36:13,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_0_to_51_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:13,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2061037866, now seen corresponding path program 1 times [2025-02-06 14:36:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:13,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52826384] [2025-02-06 14:36:13,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:13,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:36:13,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:36:13,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:13,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:13,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:13,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52826384] [2025-02-06 14:36:13,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52826384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:13,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:13,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:13,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963197823] [2025-02-06 14:36:13,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:13,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:13,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:13,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:13,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:13,876 INFO L87 Difference]: Start difference. First operand 512 states and 861 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:14,050 INFO L93 Difference]: Finished difference Result 551 states and 889 transitions. [2025-02-06 14:36:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:14,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 30 [2025-02-06 14:36:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:14,053 INFO L225 Difference]: With dead ends: 551 [2025-02-06 14:36:14,053 INFO L226 Difference]: Without dead ends: 550 [2025-02-06 14:36:14,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:14,054 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 108 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:14,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 629 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-06 14:36:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 517. [2025-02-06 14:36:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 409 states have (on average 1.6405867970660146) internal successors, (671), 474 states have internal predecessors, (671), 30 states have call successors, (30), 10 states have call predecessors, (30), 36 states have return successors, (166), 34 states have call predecessors, (166), 30 states have call successors, (166) [2025-02-06 14:36:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 867 transitions. [2025-02-06 14:36:14,078 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 867 transitions. Word has length 30 [2025-02-06 14:36:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:14,078 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 867 transitions. [2025-02-06 14:36:14,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 867 transitions. [2025-02-06 14:36:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 14:36:14,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:14,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:14,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 14:36:14,079 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_0_to_51_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:14,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1348610646, now seen corresponding path program 1 times [2025-02-06 14:36:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:14,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750693488] [2025-02-06 14:36:14,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:14,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:36:14,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:36:14,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:14,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:14,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333637712] [2025-02-06 14:36:14,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:14,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:14,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:14,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 14:36:14,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:36:14,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:36:14,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:14,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:14,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 14:36:14,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:14,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:14,251 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 19 treesize of output 11 [2025-02-06 14:36:14,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:14,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:36:14,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:36:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:14,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:14,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:14,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750693488] [2025-02-06 14:36:14,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:14,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333637712] [2025-02-06 14:36:14,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333637712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:14,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:14,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:36:14,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193950271] [2025-02-06 14:36:14,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:14,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 14:36:14,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:14,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 14:36:14,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:36:14,415 INFO L87 Difference]: Start difference. First operand 517 states and 867 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:18,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:22,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:26,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:30,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:34,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:38,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:42,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:46,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:50,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:54,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:36:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:54,738 INFO L93 Difference]: Finished difference Result 569 states and 906 transitions. [2025-02-06 14:36:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:36:54,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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 30 [2025-02-06 14:36:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:54,743 INFO L225 Difference]: With dead ends: 569 [2025-02-06 14:36:54,743 INFO L226 Difference]: Without dead ends: 568 [2025-02-06 14:36:54,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:36:54,745 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 128 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 11 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:54,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 658 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 40.2s Time] [2025-02-06 14:36:54,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-06 14:36:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 530. [2025-02-06 14:36:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 419 states have (on average 1.6252983293556087) internal successors, (681), 483 states have internal predecessors, (681), 31 states have call successors, (31), 11 states have call predecessors, (31), 38 states have return successors, (167), 37 states have call predecessors, (167), 31 states have call successors, (167) [2025-02-06 14:36:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 879 transitions. [2025-02-06 14:36:54,773 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 879 transitions. Word has length 30 [2025-02-06 14:36:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:54,774 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 879 transitions. [2025-02-06 14:36:54,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 879 transitions. [2025-02-06 14:36:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:36:54,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:54,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:54,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 14:36:54,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:54,978 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_0_to_51_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:54,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -532310741, now seen corresponding path program 1 times [2025-02-06 14:36:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257287346] [2025-02-06 14:36:54,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:54,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:54,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:36:54,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:36:54,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:54,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:55,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:55,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257287346] [2025-02-06 14:36:55,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257287346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:55,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159853819] [2025-02-06 14:36:55,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:55,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:55,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:55,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:55,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:55,127 INFO L87 Difference]: Start difference. First operand 530 states and 879 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:55,265 INFO L93 Difference]: Finished difference Result 624 states and 1000 transitions. [2025-02-06 14:36:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 31 [2025-02-06 14:36:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:55,269 INFO L225 Difference]: With dead ends: 624 [2025-02-06 14:36:55,269 INFO L226 Difference]: Without dead ends: 623 [2025-02-06 14:36:55,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:55,270 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 137 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:55,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 638 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-02-06 14:36:55,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 584. [2025-02-06 14:36:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 465 states have (on average 1.632258064516129) internal successors, (759), 532 states have internal predecessors, (759), 34 states have call successors, (34), 12 states have call predecessors, (34), 43 states have return successors, (189), 41 states have call predecessors, (189), 34 states have call successors, (189) [2025-02-06 14:36:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 982 transitions. [2025-02-06 14:36:55,296 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 982 transitions. Word has length 31 [2025-02-06 14:36:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:55,296 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 982 transitions. [2025-02-06 14:36:55,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 982 transitions. [2025-02-06 14:36:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:36:55,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:55,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:55,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 14:36:55,298 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_0_to_51_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:55,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash -532335566, now seen corresponding path program 1 times [2025-02-06 14:36:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757610973] [2025-02-06 14:36:55,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:55,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:36:55,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:36:55,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:55,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:55,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:55,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757610973] [2025-02-06 14:36:55,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757610973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:55,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:55,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022309959] [2025-02-06 14:36:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:55,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:55,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:55,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:55,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:55,432 INFO L87 Difference]: Start difference. First operand 584 states and 982 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:55,574 INFO L93 Difference]: Finished difference Result 633 states and 1018 transitions. [2025-02-06 14:36:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:55,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 31 [2025-02-06 14:36:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:55,577 INFO L225 Difference]: With dead ends: 633 [2025-02-06 14:36:55,577 INFO L226 Difference]: Without dead ends: 632 [2025-02-06 14:36:55,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:55,577 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 127 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:55,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 640 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-02-06 14:36:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 584. [2025-02-06 14:36:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 465 states have (on average 1.6258064516129032) internal successors, (756), 532 states have internal predecessors, (756), 34 states have call successors, (34), 12 states have call predecessors, (34), 43 states have return successors, (189), 41 states have call predecessors, (189), 34 states have call successors, (189) [2025-02-06 14:36:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 979 transitions. [2025-02-06 14:36:55,606 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 979 transitions. Word has length 31 [2025-02-06 14:36:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:55,606 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 979 transitions. [2025-02-06 14:36:55,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 979 transitions. [2025-02-06 14:36:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:36:55,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:55,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:55,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 14:36:55,607 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_0_to_51_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:36:55,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1142742945, now seen corresponding path program 1 times [2025-02-06 14:36:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275365631] [2025-02-06 14:36:55,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:55,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:36:55,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:36:55,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:55,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:55,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919466993] [2025-02-06 14:36:55,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:55,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:55,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:55,640 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:55,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 14:36:55,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:36:55,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:36:55,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:55,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:55,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 14:36:55,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:55,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:55,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:36:55,807 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 30 treesize of output 18 [2025-02-06 14:36:55,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:56,033 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 22 treesize of output 10 [2025-02-06 14:36:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:56,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275365631] [2025-02-06 14:36:56,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919466993] [2025-02-06 14:36:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919466993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:56,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:36:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543854313] [2025-02-06 14:36:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:56,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 14:36:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:56,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 14:36:56,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:36:56,052 INFO L87 Difference]: Start difference. First operand 584 states and 979 transitions. Second operand has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:00,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:04,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:08,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:08,327 INFO L93 Difference]: Finished difference Result 621 states and 1003 transitions. [2025-02-06 14:37:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:37:08,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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 31 [2025-02-06 14:37:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:08,330 INFO L225 Difference]: With dead ends: 621 [2025-02-06 14:37:08,330 INFO L226 Difference]: Without dead ends: 620 [2025-02-06 14:37:08,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:37:08,331 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 122 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:08,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 751 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 221 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-02-06 14:37:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-02-06 14:37:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 584. [2025-02-06 14:37:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 465 states have (on average 1.621505376344086) internal successors, (754), 532 states have internal predecessors, (754), 34 states have call successors, (34), 12 states have call predecessors, (34), 43 states have return successors, (189), 41 states have call predecessors, (189), 34 states have call successors, (189) [2025-02-06 14:37:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 977 transitions. [2025-02-06 14:37:08,356 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 977 transitions. Word has length 31 [2025-02-06 14:37:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:08,356 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 977 transitions. [2025-02-06 14:37:08,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 977 transitions. [2025-02-06 14:37:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 14:37:08,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:08,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:08,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 14:37:08,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:08,561 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_0_to_51_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:37:08,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash 678236264, now seen corresponding path program 1 times [2025-02-06 14:37:08,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:08,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361637331] [2025-02-06 14:37:08,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:08,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:37:08,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:37:08,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:08,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:08,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:08,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361637331] [2025-02-06 14:37:08,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361637331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:08,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:08,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:08,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321821461] [2025-02-06 14:37:08,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:08,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:08,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:08,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:08,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:08,694 INFO L87 Difference]: Start difference. First operand 584 states and 977 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:08,826 INFO L93 Difference]: Finished difference Result 613 states and 997 transitions. [2025-02-06 14:37:08,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:37:08,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 32 [2025-02-06 14:37:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:08,829 INFO L225 Difference]: With dead ends: 613 [2025-02-06 14:37:08,829 INFO L226 Difference]: Without dead ends: 612 [2025-02-06 14:37:08,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:08,829 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 98 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:08,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 625 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-06 14:37:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 587. [2025-02-06 14:37:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 468 states have (on average 1.6196581196581197) internal successors, (758), 535 states have internal predecessors, (758), 34 states have call successors, (34), 12 states have call predecessors, (34), 43 states have return successors, (189), 41 states have call predecessors, (189), 34 states have call successors, (189) [2025-02-06 14:37:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 981 transitions. [2025-02-06 14:37:08,879 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 981 transitions. Word has length 32 [2025-02-06 14:37:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:08,879 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 981 transitions. [2025-02-06 14:37:08,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 981 transitions. [2025-02-06 14:37:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 14:37:08,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:08,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:08,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 14:37:08,880 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_0_to_51_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:37:08,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash 677466664, now seen corresponding path program 1 times [2025-02-06 14:37:08,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:08,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037482803] [2025-02-06 14:37:08,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:08,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:08,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:37:08,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:37:08,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:08,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:37:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346028485] [2025-02-06 14:37:08,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:08,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:08,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:08,904 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:37:08,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 14:37:08,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:37:09,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:37:09,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:09,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:09,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 14:37:09,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:09,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:37:09,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:37:09,035 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 25 treesize of output 17 [2025-02-06 14:37:09,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:37:09,217 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 25 treesize of output 13 [2025-02-06 14:37:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:09,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:09,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:09,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037482803] [2025-02-06 14:37:09,233 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:37:09,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346028485] [2025-02-06 14:37:09,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346028485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:09,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:09,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 14:37:09,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611815984] [2025-02-06 14:37:09,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:09,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 14:37:09,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:09,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 14:37:09,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:09,234 INFO L87 Difference]: Start difference. First operand 587 states and 981 transitions. Second operand has 10 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:13,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:17,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:21,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:21,516 INFO L93 Difference]: Finished difference Result 632 states and 1013 transitions. [2025-02-06 14:37:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 14:37:21,517 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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 32 [2025-02-06 14:37:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:21,519 INFO L225 Difference]: With dead ends: 632 [2025-02-06 14:37:21,519 INFO L226 Difference]: Without dead ends: 631 [2025-02-06 14:37:21,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:37:21,520 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 156 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:21,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 506 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 203 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-02-06 14:37:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-02-06 14:37:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 598. [2025-02-06 14:37:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 476 states have (on average 1.6092436974789917) internal successors, (766), 544 states have internal predecessors, (766), 36 states have call successors, (36), 14 states have call predecessors, (36), 44 states have return successors, (186), 43 states have call predecessors, (186), 36 states have call successors, (186) [2025-02-06 14:37:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 988 transitions. [2025-02-06 14:37:21,547 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 988 transitions. Word has length 32 [2025-02-06 14:37:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:21,547 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 988 transitions. [2025-02-06 14:37:21,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 988 transitions. [2025-02-06 14:37:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 14:37:21,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:21,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:21,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 14:37:21,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 14:37:21,752 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_0_to_51_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:37:21,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1065292936, now seen corresponding path program 1 times [2025-02-06 14:37:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:21,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518392890] [2025-02-06 14:37:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:21,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:37:21,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:37:21,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:21,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518392890] [2025-02-06 14:37:21,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518392890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:21,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:21,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:21,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856234563] [2025-02-06 14:37:21,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:21,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:21,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:21,846 INFO L87 Difference]: Start difference. First operand 598 states and 988 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:21,974 INFO L93 Difference]: Finished difference Result 660 states and 1044 transitions. [2025-02-06 14:37:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:37:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 32 [2025-02-06 14:37:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:21,977 INFO L225 Difference]: With dead ends: 660 [2025-02-06 14:37:21,977 INFO L226 Difference]: Without dead ends: 659 [2025-02-06 14:37:21,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:21,977 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 159 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:21,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 520 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-06 14:37:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 603. [2025-02-06 14:37:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 481 states have (on average 1.6091476091476091) internal successors, (774), 549 states have internal predecessors, (774), 36 states have call successors, (36), 14 states have call predecessors, (36), 44 states have return successors, (186), 43 states have call predecessors, (186), 36 states have call successors, (186) [2025-02-06 14:37:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 996 transitions. [2025-02-06 14:37:22,003 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 996 transitions. Word has length 32 [2025-02-06 14:37:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:22,004 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 996 transitions. [2025-02-06 14:37:22,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 996 transitions. [2025-02-06 14:37:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 14:37:22,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:22,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:22,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 14:37:22,004 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting func_to_recursive_line_0_to_51_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:37:22,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:22,005 INFO L85 PathProgramCache]: Analyzing trace with hash -449512247, now seen corresponding path program 1 times [2025-02-06 14:37:22,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:22,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312744442] [2025-02-06 14:37:22,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:22,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 14:37:22,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 14:37:22,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:22,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312744442] [2025-02-06 14:37:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312744442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:22,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997866114] [2025-02-06 14:37:22,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:22,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:22,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:22,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:22,123 INFO L87 Difference]: Start difference. First operand 603 states and 996 transitions. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:22,255 INFO L93 Difference]: Finished difference Result 747 states and 1203 transitions. [2025-02-06 14:37:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:37:22,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 33 [2025-02-06 14:37:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:22,257 INFO L225 Difference]: With dead ends: 747 [2025-02-06 14:37:22,258 INFO L226 Difference]: Without dead ends: 746 [2025-02-06 14:37:22,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:22,259 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 143 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:22,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 656 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-02-06 14:37:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 696. [2025-02-06 14:37:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 563 states have (on average 1.6234458259325044) internal successors, (914), 635 states have internal predecessors, (914), 41 states have call successors, (41), 16 states have call predecessors, (41), 50 states have return successors, (214), 48 states have call predecessors, (214), 41 states have call successors, (214) [2025-02-06 14:37:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1169 transitions. [2025-02-06 14:37:22,285 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1169 transitions. Word has length 33 [2025-02-06 14:37:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:22,286 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 1169 transitions. [2025-02-06 14:37:22,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1169 transitions. [2025-02-06 14:37:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 14:37:22,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:22,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:22,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 14:37:22,287 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting func_to_recursive_line_0_to_51_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:37:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash -473369872, now seen corresponding path program 1 times [2025-02-06 14:37:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:22,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639858042] [2025-02-06 14:37:22,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:22,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 14:37:22,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 14:37:22,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:22,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:37:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900586897] [2025-02-06 14:37:22,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:22,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:22,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:22,315 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-02-06 14:37:22,316 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-02-06 14:37:22,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 14:37:22,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 14:37:22,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:22,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:22,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 14:37:22,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:22,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:37:22,448 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 23 treesize of output 15 [2025-02-06 14:37:22,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:37:22,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:37:22,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:37:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:22,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:22,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:22,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639858042] [2025-02-06 14:37:22,600 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:37:22,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900586897] [2025-02-06 14:37:22,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900586897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:22,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:22,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:37:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823722320] [2025-02-06 14:37:22,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:22,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:37:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:22,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:37:22,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:37:22,601 INFO L87 Difference]: Start difference. First operand 696 states and 1169 transitions. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:26,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:30,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:34,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:34,826 INFO L93 Difference]: Finished difference Result 729 states and 1192 transitions. [2025-02-06 14:37:34,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 14:37:34,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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 33 [2025-02-06 14:37:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:34,829 INFO L225 Difference]: With dead ends: 729 [2025-02-06 14:37:34,829 INFO L226 Difference]: Without dead ends: 728 [2025-02-06 14:37:34,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:37:34,830 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 100 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:34,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 640 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-02-06 14:37:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-02-06 14:37:34,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 696. [2025-02-06 14:37:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 563 states have (on average 1.6198934280639432) internal successors, (912), 635 states have internal predecessors, (912), 41 states have call successors, (41), 16 states have call predecessors, (41), 50 states have return successors, (214), 48 states have call predecessors, (214), 41 states have call successors, (214) [2025-02-06 14:37:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1167 transitions. [2025-02-06 14:37:34,860 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1167 transitions. Word has length 33 [2025-02-06 14:37:34,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:34,861 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 1167 transitions. [2025-02-06 14:37:34,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1167 transitions. [2025-02-06 14:37:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 14:37:34,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:34,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:34,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 14:37:35,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:35,062 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting func_to_recursive_line_0_to_51_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:37:35,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1335657345, now seen corresponding path program 1 times [2025-02-06 14:37:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:35,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579897826] [2025-02-06 14:37:35,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:35,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:35,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 14:37:35,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 14:37:35,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:35,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:35,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579897826] [2025-02-06 14:37:35,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579897826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:35,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:35,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:35,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952376571] [2025-02-06 14:37:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:35,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:35,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:35,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:35,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:35,208 INFO L87 Difference]: Start difference. First operand 696 states and 1167 transitions. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:35,357 INFO L93 Difference]: Finished difference Result 752 states and 1213 transitions. [2025-02-06 14:37:35,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:37:35,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 33 [2025-02-06 14:37:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:35,360 INFO L225 Difference]: With dead ends: 752 [2025-02-06 14:37:35,360 INFO L226 Difference]: Without dead ends: 751 [2025-02-06 14:37:35,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:35,360 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 155 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:35,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 627 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-02-06 14:37:35,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 697. [2025-02-06 14:37:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 564 states have (on average 1.6170212765957446) internal successors, (912), 636 states have internal predecessors, (912), 41 states have call successors, (41), 16 states have call predecessors, (41), 50 states have return successors, (214), 48 states have call predecessors, (214), 41 states have call successors, (214) [2025-02-06 14:37:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1167 transitions. [2025-02-06 14:37:35,387 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1167 transitions. Word has length 33 [2025-02-06 14:37:35,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:35,387 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1167 transitions. [2025-02-06 14:37:35,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:37:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1167 transitions. [2025-02-06 14:37:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 14:37:35,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:35,388 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:35,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 14:37:35,388 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting func_to_recursive_line_0_to_51_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-02-06 14:37:35,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash 854646145, now seen corresponding path program 1 times [2025-02-06 14:37:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:35,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569015989] [2025-02-06 14:37:35,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:35,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 14:37:35,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 14:37:35,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:35,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:37:35,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [300972980] [2025-02-06 14:37:35,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:35,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:35,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:35,422 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-02-06 14:37:35,424 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-02-06 14:37:35,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 14:37:35,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 14:37:35,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:35,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:35,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-02-06 14:37:35,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:35,597 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 23 treesize of output 15 [2025-02-06 14:37:35,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:37:35,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:37:35,669 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