./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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_sqrt1.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 b23f88f1df76f11fbfc8e6288f4ade0e00ecdc2b8889a67f3774db6dfccf1d90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:05:39,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:05:39,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:05:39,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:05:39,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:05:39,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:05:39,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:05:39,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:05:39,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:05:39,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:05:39,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:05:39,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:05:39,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:05:39,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:05:39,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:05:39,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:39,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:05:39,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:05:39,865 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 -> b23f88f1df76f11fbfc8e6288f4ade0e00ecdc2b8889a67f3774db6dfccf1d90 [2025-02-08 10:05:40,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:05:40,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:05:40,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:05:40,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:05:40,104 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:05:40,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c [2025-02-08 10:05:41,268 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/548395d42/45a6cf919b9b471f9303f977cff5d9b3/FLAG48ab3974c [2025-02-08 10:05:41,508 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:05:41,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c [2025-02-08 10:05:41,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/548395d42/45a6cf919b9b471f9303f977cff5d9b3/FLAG48ab3974c [2025-02-08 10:05:41,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/548395d42/45a6cf919b9b471f9303f977cff5d9b3 [2025-02-08 10:05:41,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:05:41,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:05:41,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:41,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:05:41,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:05:41,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:41" (1/1) ... [2025-02-08 10:05:41,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74aece11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:41, skipping insertion in model container [2025-02-08 10:05:41,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:41" (1/1) ... [2025-02-08 10:05:41,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:05:42,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:42,054 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:05:42,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:42,083 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:05:42,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42 WrapperNode [2025-02-08 10:05:42,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:42,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:42,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:05:42,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:05:42,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,112 INFO L138 Inliner]: procedures = 16, calls = 67, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2025-02-08 10:05:42,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:42,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:05:42,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:05:42,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:05:42,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,142 INFO L175 MemorySlicer]: Split 41 memory accesses to 6 slices as follows [2, 9, 8, 2, 12, 8]. 29 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 1, 2, 2]. [2025-02-08 10:05:42,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:05:42,161 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:05:42,161 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:05:42,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:05:42,162 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (1/1) ... [2025-02-08 10:05:42,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:42,191 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-08 10:05:42,201 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-08 10:05:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:05:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_39_0 [2025-02-08 10:05:42,226 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_39_0 [2025-02-08 10:05:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:05:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:05:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:05:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:05:42,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:05:42,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:05:42,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:05:42,311 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:05:42,312 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:05:42,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L76: call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~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_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset;call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset);havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-08 10:05:42,588 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-02-08 10:05:42,588 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:05:42,597 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:05:42,597 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:05:42,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:42 BoogieIcfgContainer [2025-02-08 10:05:42,598 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:05:42,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:05:42,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:05:42,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:05:42,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:05:41" (1/3) ... [2025-02-08 10:05:42,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213f1219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:42, skipping insertion in model container [2025-02-08 10:05:42,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:42" (2/3) ... [2025-02-08 10:05:42,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213f1219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:42, skipping insertion in model container [2025-02-08 10:05:42,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:42" (3/3) ... [2025-02-08 10:05:42,606 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_sqrt1.c [2025-02-08 10:05:42,616 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:05:42,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_sqrt1.c that has 3 procedures, 128 locations, 1 initial locations, 0 loop locations, and 50 error locations. [2025-02-08 10:05:42,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:05:42,668 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;@16ffd305, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:05:42,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-08 10:05:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 67 states have (on average 1.791044776119403) internal successors, (120), 118 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 10:05:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 10:05:42,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:42,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 10:05:42,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_28_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:05:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash 149410735, now seen corresponding path program 1 times [2025-02-08 10:05:42,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:42,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764451463] [2025-02-08 10:05:42,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:42,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:42,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 10:05:42,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 10:05:42,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:42,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:43,077 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-08 10:05:43,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:43,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764451463] [2025-02-08 10:05:43,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764451463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:43,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:43,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094267192] [2025-02-08 10:05:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:43,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:43,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:43,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:43,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:43,093 INFO L87 Difference]: Start difference. First operand has 128 states, 67 states have (on average 1.791044776119403) internal successors, (120), 118 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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-08 10:05:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:43,228 INFO L93 Difference]: Finished difference Result 324 states and 361 transitions. [2025-02-08 10:05:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:43,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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 5 [2025-02-08 10:05:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:43,235 INFO L225 Difference]: With dead ends: 324 [2025-02-08 10:05:43,235 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 10:05:43,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:43,239 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 118 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:43,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 578 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 10:05:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 156. [2025-02-08 10:05:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.7419354838709677) internal successors, (162), 143 states have internal predecessors, (162), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-08 10:05:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2025-02-08 10:05:43,274 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 5 [2025-02-08 10:05:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:43,274 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2025-02-08 10:05:43,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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-08 10:05:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2025-02-08 10:05:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 10:05:43,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:43,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:43,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:05:43,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_28_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:05:43,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash -746743103, now seen corresponding path program 1 times [2025-02-08 10:05:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601555096] [2025-02-08 10:05:43,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:43,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:43,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 10:05:43,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 10:05:43,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:43,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:43,445 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-08 10:05:43,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:43,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601555096] [2025-02-08 10:05:43,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601555096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:43,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:43,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:43,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871269236] [2025-02-08 10:05:43,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:43,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:43,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:43,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:43,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:43,447 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 10:05:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:43,552 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2025-02-08 10:05:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2025-02-08 10:05:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:43,554 INFO L225 Difference]: With dead ends: 193 [2025-02-08 10:05:43,554 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 10:05:43,554 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-08 10:05:43,554 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 113 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:43,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 548 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 10:05:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 156. [2025-02-08 10:05:43,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 143 states have internal predecessors, (160), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-08 10:05:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2025-02-08 10:05:43,572 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 15 [2025-02-08 10:05:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:43,572 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2025-02-08 10:05:43,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 10:05:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2025-02-08 10:05:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 10:05:43,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:43,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:43,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:05:43,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_28_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:05:43,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash -360582817, now seen corresponding path program 1 times [2025-02-08 10:05:43,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:43,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737039296] [2025-02-08 10:05:43,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:43,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 10:05:43,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 10:05:43,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:43,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:43,763 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-08 10:05:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737039296] [2025-02-08 10:05:43,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737039296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:43,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:43,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:43,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489198316] [2025-02-08 10:05:43,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:43,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:43,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:43,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:43,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:43,765 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-08 10:05:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:43,880 INFO L93 Difference]: Finished difference Result 191 states and 201 transitions. [2025-02-08 10:05:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:43,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 17 [2025-02-08 10:05:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:43,882 INFO L225 Difference]: With dead ends: 191 [2025-02-08 10:05:43,883 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 10:05:43,883 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-08 10:05:43,883 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:43,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 545 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 10:05:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2025-02-08 10:05:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.6989247311827957) internal successors, (158), 143 states have internal predecessors, (158), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-08 10:05:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2025-02-08 10:05:43,895 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 17 [2025-02-08 10:05:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:43,895 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2025-02-08 10:05:43,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-08 10:05:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2025-02-08 10:05:43,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 10:05:43,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:43,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:43,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 10:05:43,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_28_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:05:43,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1372264445, now seen corresponding path program 1 times [2025-02-08 10:05:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81319839] [2025-02-08 10:05:43,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:43,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:43,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 10:05:43,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 10:05:43,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:43,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147214001] [2025-02-08 10:05:43,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:43,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:43,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:43,932 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-08 10:05:43,934 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-08 10:05:43,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 10:05:43,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 10:05:43,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:43,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:44,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 10:05:44,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:44,042 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-08 10:05:44,047 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-08 10:05:44,168 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-08 10:05:44,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:44,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:44,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81319839] [2025-02-08 10:05:44,169 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:44,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147214001] [2025-02-08 10:05:44,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147214001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:44,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:44,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:05:44,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347031192] [2025-02-08 10:05:44,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:44,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:05:44,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:44,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:05:44,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:44,171 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-08 10:05:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:44,344 INFO L93 Difference]: Finished difference Result 227 states and 236 transitions. [2025-02-08 10:05:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 19 [2025-02-08 10:05:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:44,345 INFO L225 Difference]: With dead ends: 227 [2025-02-08 10:05:44,345 INFO L226 Difference]: Without dead ends: 225 [2025-02-08 10:05:44,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:05:44,346 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 234 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:44,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 516 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-08 10:05:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 174. [2025-02-08 10:05:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6759259259259258) internal successors, (181), 158 states have internal predecessors, (181), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:05:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2025-02-08 10:05:44,360 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 19 [2025-02-08 10:05:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:44,361 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2025-02-08 10:05:44,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-08 10:05:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2025-02-08 10:05:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 10:05:44,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:44,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:44,369 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-08 10:05:44,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:44,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_28_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:05:44,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:44,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1305270597, now seen corresponding path program 1 times [2025-02-08 10:05:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494745173] [2025-02-08 10:05:44,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:44,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 10:05:44,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 10:05:44,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:44,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:44,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415291634] [2025-02-08 10:05:44,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:44,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:44,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:44,586 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-08 10:05:44,587 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-08 10:05:44,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 10:05:44,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 10:05:44,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:44,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:44,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 10:05:44,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:44,658 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-08 10:05:44,784 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-08 10:05:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:44,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:44,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:44,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494745173] [2025-02-08 10:05:44,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:44,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415291634] [2025-02-08 10:05:44,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415291634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:05:44,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:05:44,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-08 10:05:44,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757578793] [2025-02-08 10:05:44,889 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:44,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 10:05:44,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:44,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 10:05:44,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-08 10:05:44,891 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:49,129 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-08 10:05:53,240 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-08 10:05:57,244 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-08 10:05:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:57,261 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2025-02-08 10:05:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 10:05:57,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-08 10:05:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:57,262 INFO L225 Difference]: With dead ends: 229 [2025-02-08 10:05:57,263 INFO L226 Difference]: Without dead ends: 228 [2025-02-08 10:05:57,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-08 10:05:57,263 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 204 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:57,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 918 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 353 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-02-08 10:05:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-08 10:05:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 174. [2025-02-08 10:05:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6666666666666667) internal successors, (180), 158 states have internal predecessors, (180), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:05:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 205 transitions. [2025-02-08 10:05:57,288 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 205 transitions. Word has length 27 [2025-02-08 10:05:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:57,288 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 205 transitions. [2025-02-08 10:05:57,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 205 transitions. [2025-02-08 10:05:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:05:57,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:57,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:57,300 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-08 10:05:57,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:57,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_28_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:05:57,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:57,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1808682834, now seen corresponding path program 1 times [2025-02-08 10:05:57,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:57,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188618526] [2025-02-08 10:05:57,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:57,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:57,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:05:57,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:05:57,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:57,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781560948] [2025-02-08 10:05:57,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:57,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:57,523 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-08 10:05:57,524 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-08 10:05:57,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:05:57,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:05:57,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:57,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:57,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 10:05:57,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:57,589 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-08 10:05:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:57,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:57,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:57,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188618526] [2025-02-08 10:05:57,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:57,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781560948] [2025-02-08 10:05:57,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781560948] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:05:57,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:05:57,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-08 10:05:57,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716378305] [2025-02-08 10:05:57,812 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:57,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 10:05:57,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:57,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 10:05:57,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-08 10:05:57,812 INFO L87 Difference]: Start difference. First operand 174 states and 205 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:58,295 INFO L93 Difference]: Finished difference Result 228 states and 237 transitions. [2025-02-08 10:05:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 10:05:58,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-02-08 10:05:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:58,297 INFO L225 Difference]: With dead ends: 228 [2025-02-08 10:05:58,297 INFO L226 Difference]: Without dead ends: 227 [2025-02-08 10:05:58,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-08 10:05:58,298 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 234 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:58,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 867 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-08 10:05:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 174. [2025-02-08 10:05:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6574074074074074) internal successors, (179), 158 states have internal predecessors, (179), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:05:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 204 transitions. [2025-02-08 10:05:58,305 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 204 transitions. Word has length 28 [2025-02-08 10:05:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:58,305 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 204 transitions. [2025-02-08 10:05:58,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 204 transitions. [2025-02-08 10:05:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:05:58,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:58,306 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:58,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 10:05:58,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:58,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_28_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:05:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -234592999, now seen corresponding path program 1 times [2025-02-08 10:05:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971329939] [2025-02-08 10:05:58,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:58,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:58,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:58,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:58,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:58,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:05:58,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:58,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971329939] [2025-02-08 10:05:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971329939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:58,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:58,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248965313] [2025-02-08 10:05:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:58,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:58,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:58,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:58,651 INFO L87 Difference]: Start difference. First operand 174 states and 204 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:05:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:58,757 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2025-02-08 10:05:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:58,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-08 10:05:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:58,758 INFO L225 Difference]: With dead ends: 211 [2025-02-08 10:05:58,758 INFO L226 Difference]: Without dead ends: 209 [2025-02-08 10:05:58,759 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-08 10:05:58,759 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 121 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:58,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 522 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-08 10:05:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2025-02-08 10:05:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 158 states have internal predecessors, (177), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:05:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2025-02-08 10:05:58,766 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 29 [2025-02-08 10:05:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:58,766 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2025-02-08 10:05:58,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:05:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2025-02-08 10:05:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 10:05:58,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:58,770 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:58,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 10:05:58,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_28_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:05:58,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2105572489, now seen corresponding path program 1 times [2025-02-08 10:05:58,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:58,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867815845] [2025-02-08 10:05:58,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:58,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 10:05:58,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 10:05:58,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:58,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:58,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921180985] [2025-02-08 10:05:58,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:58,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:58,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:58,797 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-08 10:05:58,798 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-08 10:05:58,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 10:05:58,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 10:05:58,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:58,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:58,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 10:05:58,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:58,875 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-08 10:05:58,878 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-08 10:05:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:59,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:59,385 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 38 treesize of output 26 [2025-02-08 10:05:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 10:05:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:59,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867815845] [2025-02-08 10:05:59,493 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:59,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921180985] [2025-02-08 10:05:59,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921180985] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:05:59,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 10:05:59,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 21 [2025-02-08 10:05:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225290739] [2025-02-08 10:05:59,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:59,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 10:05:59,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:59,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 10:05:59,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-02-08 10:05:59,494 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 10:06:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:00,408 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2025-02-08 10:06:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 10:06:00,408 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2025-02-08 10:06:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:00,409 INFO L225 Difference]: With dead ends: 229 [2025-02-08 10:06:00,409 INFO L226 Difference]: Without dead ends: 227 [2025-02-08 10:06:00,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 10:06:00,410 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 348 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:00,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 985 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 10:06:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-08 10:06:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 174. [2025-02-08 10:06:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6203703703703705) internal successors, (175), 158 states have internal predecessors, (175), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:06:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 200 transitions. [2025-02-08 10:06:00,432 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 200 transitions. Word has length 31 [2025-02-08 10:06:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:00,432 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 200 transitions. [2025-02-08 10:06:00,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 10:06:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 200 transitions. [2025-02-08 10:06:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 10:06:00,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:00,435 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:00,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 10:06:00,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 10:06:00,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_28_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:00,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:00,641 INFO L85 PathProgramCache]: Analyzing trace with hash -525565483, now seen corresponding path program 1 times [2025-02-08 10:06:00,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:00,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404717529] [2025-02-08 10:06:00,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:00,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:00,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 10:06:00,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 10:06:00,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:00,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:06:00,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:00,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404717529] [2025-02-08 10:06:00,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404717529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:00,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:00,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:06:00,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630360624] [2025-02-08 10:06:00,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:06:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:00,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:06:00,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:06:00,764 INFO L87 Difference]: Start difference. First operand 174 states and 200 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:06:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:00,868 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2025-02-08 10:06:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:06:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-02-08 10:06:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:00,869 INFO L225 Difference]: With dead ends: 211 [2025-02-08 10:06:00,869 INFO L226 Difference]: Without dead ends: 209 [2025-02-08 10:06:00,869 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-08 10:06:00,870 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 103 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:00,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 528 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-08 10:06:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2025-02-08 10:06:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 158 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:06:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 198 transitions. [2025-02-08 10:06:00,876 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 198 transitions. Word has length 33 [2025-02-08 10:06:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:00,876 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 198 transitions. [2025-02-08 10:06:00,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:06:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2025-02-08 10:06:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 10:06:00,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:00,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:00,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 10:06:00,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_28_to_39_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:00,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1737711667, now seen corresponding path program 1 times [2025-02-08 10:06:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:00,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424380131] [2025-02-08 10:06:00,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:00,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:00,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 10:06:00,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 10:06:00,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:00,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:06:00,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:00,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424380131] [2025-02-08 10:06:00,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424380131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:00,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:00,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:06:00,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035632980] [2025-02-08 10:06:00,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:00,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:06:00,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:00,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:06:00,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:06:00,999 INFO L87 Difference]: Start difference. First operand 174 states and 198 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:06:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:01,144 INFO L93 Difference]: Finished difference Result 209 states and 219 transitions. [2025-02-08 10:06:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:06:01,144 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-02-08 10:06:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:01,145 INFO L225 Difference]: With dead ends: 209 [2025-02-08 10:06:01,145 INFO L226 Difference]: Without dead ends: 207 [2025-02-08 10:06:01,146 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-08 10:06:01,146 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:01,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 541 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-08 10:06:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 174. [2025-02-08 10:06:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.5833333333333333) internal successors, (171), 158 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:06:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2025-02-08 10:06:01,155 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 35 [2025-02-08 10:06:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:01,155 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2025-02-08 10:06:01,156 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:06:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2025-02-08 10:06:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 10:06:01,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:01,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:01,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 10:06:01,157 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_28_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:01,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:01,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1965513178, now seen corresponding path program 1 times [2025-02-08 10:06:01,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:01,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213628547] [2025-02-08 10:06:01,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:01,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 10:06:01,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 10:06:01,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:01,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:06:01,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:01,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213628547] [2025-02-08 10:06:01,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213628547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:01,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:01,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:06:01,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348956503] [2025-02-08 10:06:01,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:01,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:06:01,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:01,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:06:01,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:06:01,401 INFO L87 Difference]: Start difference. First operand 174 states and 196 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:06:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:01,692 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2025-02-08 10:06:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:06:01,696 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-02-08 10:06:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:01,697 INFO L225 Difference]: With dead ends: 199 [2025-02-08 10:06:01,697 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 10:06:01,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:06:01,697 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 95 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:01,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 579 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:06:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 10:06:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 174. [2025-02-08 10:06:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 158 states have internal predecessors, (169), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:06:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 194 transitions. [2025-02-08 10:06:01,711 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 194 transitions. Word has length 36 [2025-02-08 10:06:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:01,711 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 194 transitions. [2025-02-08 10:06:01,711 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:06:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 194 transitions. [2025-02-08 10:06:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 10:06:01,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:01,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:01,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 10:06:01,712 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_28_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:01,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash -649731257, now seen corresponding path program 1 times [2025-02-08 10:06:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:01,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769766764] [2025-02-08 10:06:01,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:01,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:01,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 10:06:01,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 10:06:01,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:01,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:06:01,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:01,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769766764] [2025-02-08 10:06:01,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769766764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:01,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:01,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:06:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7502891] [2025-02-08 10:06:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:01,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:06:01,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:01,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:06:01,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:06:01,844 INFO L87 Difference]: Start difference. First operand 174 states and 194 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:01,931 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2025-02-08 10:06:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:06:01,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-02-08 10:06:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:01,933 INFO L225 Difference]: With dead ends: 184 [2025-02-08 10:06:01,934 INFO L226 Difference]: Without dead ends: 182 [2025-02-08 10:06:01,935 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-08 10:06:01,935 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 49 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:01,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 561 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-08 10:06:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2025-02-08 10:06:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 110 states have (on average 1.5545454545454545) internal successors, (171), 160 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:06:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2025-02-08 10:06:01,965 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 46 [2025-02-08 10:06:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:01,966 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2025-02-08 10:06:01,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2025-02-08 10:06:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 10:06:01,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:01,967 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:01,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:06:01,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_28_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:01,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1621480731, now seen corresponding path program 1 times [2025-02-08 10:06:01,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:01,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735687227] [2025-02-08 10:06:01,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:01,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:01,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 10:06:01,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 10:06:01,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:01,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:06:02,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:02,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735687227] [2025-02-08 10:06:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735687227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:02,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:06:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050524933] [2025-02-08 10:06:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:02,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:06:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:02,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:06:02,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:06:02,083 INFO L87 Difference]: Start difference. First operand 176 states and 196 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:02,161 INFO L93 Difference]: Finished difference Result 203 states and 213 transitions. [2025-02-08 10:06:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:06:02,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-08 10:06:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:02,162 INFO L225 Difference]: With dead ends: 203 [2025-02-08 10:06:02,162 INFO L226 Difference]: Without dead ends: 201 [2025-02-08 10:06:02,162 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-08 10:06:02,163 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 72 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:02,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 556 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-08 10:06:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 178. [2025-02-08 10:06:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 112 states have (on average 1.5446428571428572) internal successors, (173), 162 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-08 10:06:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2025-02-08 10:06:02,174 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 48 [2025-02-08 10:06:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:02,174 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2025-02-08 10:06:02,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2025-02-08 10:06:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 10:06:02,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:02,175 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:02,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 10:06:02,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:02,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1273751855, now seen corresponding path program 1 times [2025-02-08 10:06:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396647778] [2025-02-08 10:06:02,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:02,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 10:06:02,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 10:06:02,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:02,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:06:02,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:02,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396647778] [2025-02-08 10:06:02,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396647778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:02,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:02,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:06:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367256478] [2025-02-08 10:06:02,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:02,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:06:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:02,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:06:02,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:06:02,279 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 10:06:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:02,360 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2025-02-08 10:06:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:06:02,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2025-02-08 10:06:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:02,361 INFO L225 Difference]: With dead ends: 186 [2025-02-08 10:06:02,361 INFO L226 Difference]: Without dead ends: 182 [2025-02-08 10:06:02,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:06:02,362 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 42 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:02,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 362 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-08 10:06:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-02-08 10:06:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 163 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-08 10:06:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2025-02-08 10:06:02,374 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 49 [2025-02-08 10:06:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:02,375 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2025-02-08 10:06:02,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 10:06:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2025-02-08 10:06:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 10:06:02,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:02,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:02,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 10:06:02,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:02,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash 830145155, now seen corresponding path program 1 times [2025-02-08 10:06:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:02,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827368920] [2025-02-08 10:06:02,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:02,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:02,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 10:06:02,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 10:06:02,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:02,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:06:02,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:02,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827368920] [2025-02-08 10:06:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827368920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:02,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:06:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080715866] [2025-02-08 10:06:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:06:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:02,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:06:02,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:06:02,651 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:02,775 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2025-02-08 10:06:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:06:02,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-02-08 10:06:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:02,777 INFO L225 Difference]: With dead ends: 194 [2025-02-08 10:06:02,777 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 10:06:02,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:06:02,779 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 60 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:02,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 615 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:02,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 10:06:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2025-02-08 10:06:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 114 states have (on average 1.5) internal successors, (171), 164 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-08 10:06:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2025-02-08 10:06:02,788 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 50 [2025-02-08 10:06:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:02,788 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2025-02-08 10:06:02,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2025-02-08 10:06:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 10:06:02,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:02,789 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:06:02,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 10:06:02,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:02,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:02,790 INFO L85 PathProgramCache]: Analyzing trace with hash -35304000, now seen corresponding path program 1 times [2025-02-08 10:06:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:02,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312870000] [2025-02-08 10:06:02,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:02,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 10:06:02,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 10:06:02,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:02,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:06:03,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312870000] [2025-02-08 10:06:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312870000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:03,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:03,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:06:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6543932] [2025-02-08 10:06:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:03,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:06:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:03,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:06:03,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:06:03,023 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:03,146 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2025-02-08 10:06:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:06:03,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-02-08 10:06:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:03,147 INFO L225 Difference]: With dead ends: 194 [2025-02-08 10:06:03,148 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 10:06:03,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:06:03,149 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 59 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:03,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 620 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 10:06:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2025-02-08 10:06:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 165 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-08 10:06:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2025-02-08 10:06:03,157 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 51 [2025-02-08 10:06:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:03,157 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2025-02-08 10:06:03,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:06:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2025-02-08 10:06:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 10:06:03,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:03,158 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:03,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 10:06:03,158 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_28_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -885562721, now seen corresponding path program 1 times [2025-02-08 10:06:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:03,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379475171] [2025-02-08 10:06:03,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:03,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 10:06:03,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 10:06:03,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:03,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:06:03,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379475171] [2025-02-08 10:06:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379475171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:03,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643931388] [2025-02-08 10:06:03,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:03,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:03,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:03,401 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-08 10:06:03,403 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-08 10:06:03,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 10:06:03,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 10:06:03,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:03,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:03,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 10:06:03,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:03,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-02-08 10:06:03,691 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-08 10:06:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:06:03,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:06:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:06:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643931388] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:06:03,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:06:03,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-02-08 10:06:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695813536] [2025-02-08 10:06:03,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:06:03,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 10:06:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:03,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 10:06:03,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-02-08 10:06:03,840 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand has 21 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 17 states have internal predecessors, (118), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-08 10:06:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:04,170 INFO L93 Difference]: Finished difference Result 187 states and 205 transitions. [2025-02-08 10:06:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 10:06:04,170 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 17 states have internal predecessors, (118), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2025-02-08 10:06:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:04,171 INFO L225 Difference]: With dead ends: 187 [2025-02-08 10:06:04,171 INFO L226 Difference]: Without dead ends: 184 [2025-02-08 10:06:04,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 93 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2025-02-08 10:06:04,172 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 325 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:04,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1365 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:06:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-08 10:06:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 179. [2025-02-08 10:06:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 162 states have internal predecessors, (169), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-08 10:06:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2025-02-08 10:06:04,184 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 55 [2025-02-08 10:06:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:04,184 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2025-02-08 10:06:04,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 17 states have internal predecessors, (118), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-08 10:06:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2025-02-08 10:06:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 10:06:04,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:04,185 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:06:04,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 10:06:04,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 10:06:04,386 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_28_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 10:06:04,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:04,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1682640542, now seen corresponding path program 1 times [2025-02-08 10:06:04,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:04,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372011962] [2025-02-08 10:06:04,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:04,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:04,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 10:06:04,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 10:06:04,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:04,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:06:04,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:04,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372011962] [2025-02-08 10:06:04,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372011962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:04,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982454678] [2025-02-08 10:06:04,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:04,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:04,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:04,627 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-08 10:06:04,629 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-08 10:06:04,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 10:06:04,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 10:06:04,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:04,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:04,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 10:06:04,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:09,230 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-08 10:06:13,391 WARN L873 $PredicateComparison]: unable to prove that (exists ((|func_to_recursive_line_28_to_39_0_#t~mem12| Int) (|func_to_recursive_line_28_to_39_0_#t~mem11| Int) (|func_to_recursive_line_28_to_39_0_#t~mem10| Int) (|func_to_recursive_line_28_to_39_0_#t~mem9| Int)) (let ((.cse0 (* |func_to_recursive_line_28_to_39_0_#t~mem10| |func_to_recursive_line_28_to_39_0_#t~mem9|))) (and (<= |func_to_recursive_line_28_to_39_0_#t~mem11| 536870911) (<= 0 (+ .cse0 2147483648)) (<= (+ (* (select (select |c_#memory_int#1| c_func_to_recursive_line_28_to_39_0_~a.base) c_func_to_recursive_line_28_to_39_0_~a.offset) 2) 1) |func_to_recursive_line_28_to_39_0_#t~mem12|) (= (+ .cse0 (* |func_to_recursive_line_28_to_39_0_#t~mem12| 2) 1) (* |func_to_recursive_line_28_to_39_0_#t~mem11| 4))))) is different from true [2025-02-08 10:06:17,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2025-02-08 10:06:21,846 WARN L873 $PredicateComparison]: unable to prove that (exists ((|func_to_recursive_line_28_to_39_0_#t~mem12| Int) (|func_to_recursive_line_28_to_39_0_#t~mem11| Int) (|func_to_recursive_line_28_to_39_0_#t~mem10| Int) (|func_to_recursive_line_28_to_39_0_#t~mem9| Int)) (let ((.cse0 (* |func_to_recursive_line_28_to_39_0_#t~mem10| |func_to_recursive_line_28_to_39_0_#t~mem9|))) (and (<= (* (select (select |c_#memory_int#1| c_func_to_recursive_line_28_to_39_0_~a.base) c_func_to_recursive_line_28_to_39_0_~a.offset) 2) (+ |func_to_recursive_line_28_to_39_0_#t~mem12| 1)) (<= |func_to_recursive_line_28_to_39_0_#t~mem11| 536870911) (<= 0 (+ .cse0 2147483648)) (= (+ .cse0 (* |func_to_recursive_line_28_to_39_0_#t~mem12| 2) 1) (* |func_to_recursive_line_28_to_39_0_#t~mem11| 4))))) is different from true [2025-02-08 10:06:25,977 WARN L873 $PredicateComparison]: unable to prove that (exists ((|func_to_recursive_line_28_to_39_0_#t~mem12| Int) (|func_to_recursive_line_28_to_39_0_#t~mem11| Int) (|func_to_recursive_line_28_to_39_0_#t~mem10| Int) (|func_to_recursive_line_28_to_39_0_#t~mem9| Int)) (let ((.cse0 (* |func_to_recursive_line_28_to_39_0_#t~mem10| |func_to_recursive_line_28_to_39_0_#t~mem9|))) (and (<= |func_to_recursive_line_28_to_39_0_#t~mem11| 536870911) (<= 0 (+ .cse0 2147483648)) (<= (* 2 (select (select |c_#memory_int#1| |c_func_to_recursive_line_28_to_39_0_#in~a.base|) |c_func_to_recursive_line_28_to_39_0_#in~a.offset|)) (+ |func_to_recursive_line_28_to_39_0_#t~mem12| 1)) (= (+ .cse0 (* |func_to_recursive_line_28_to_39_0_#t~mem12| 2) 1) (* |func_to_recursive_line_28_to_39_0_#t~mem11| 4))))) is different from true [2025-02-08 10:06:26,024 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-08 10:06:30,038 WARN L873 $PredicateComparison]: unable to prove that (exists ((|func_to_recursive_line_28_to_39_0_#t~mem12| Int) (|func_to_recursive_line_28_to_39_0_#t~mem11| Int) (|func_to_recursive_line_28_to_39_0_#t~mem10| Int) (|func_to_recursive_line_28_to_39_0_#t~mem9| Int)) (let ((.cse0 (* |func_to_recursive_line_28_to_39_0_#t~mem10| |func_to_recursive_line_28_to_39_0_#t~mem9|))) (and (<= |func_to_recursive_line_28_to_39_0_#t~mem11| 536870911) (<= 0 (+ .cse0 2147483648)) (<= (* |c_func_to_recursive_line_28_to_39_0_#t~mem4| 2) (+ |func_to_recursive_line_28_to_39_0_#t~mem12| 1)) (= (+ .cse0 (* |func_to_recursive_line_28_to_39_0_#t~mem12| 2) 1) (* |func_to_recursive_line_28_to_39_0_#t~mem11| 4))))) is different from true [2025-02-08 10:06:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2025-02-08 10:06:30,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:06:39,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982454678] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:06:39,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 10:06:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 21 [2025-02-08 10:06:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984180913] [2025-02-08 10:06:39,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 10:06:39,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 10:06:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:39,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 10:06:39,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=710, Unknown=8, NotChecked=228, Total=1056 [2025-02-08 10:06:39,008 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand has 22 states, 20 states have (on average 4.35) internal successors, (87), 19 states have internal predecessors, (87), 8 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 10:06:43,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 10:06:48,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 10:06:52,502 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-08 10:07:05,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 10:07:17,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]