./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 635e58724a56c62caeff3bee7749decbe4fed7f75c2f747c3a69f15f74dc7ff3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:49:33,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:49:33,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:49:33,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:49:33,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:49:33,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:49:33,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:49:33,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:49:33,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:49:33,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:49:33,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:49:33,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:49:33,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:49:33,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:49:33,654 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:49:33,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:49:33,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:49:33,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:49:33,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:49:33,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:49:33,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:49:33,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:49:33,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:49:33,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:49:33,655 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:49:33,655 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:49:33,655 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:49:33,656 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:49:33,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:49:33,656 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 635e58724a56c62caeff3bee7749decbe4fed7f75c2f747c3a69f15f74dc7ff3 [2025-03-17 15:49:33,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:49:33,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:49:33,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:49:33,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:49:33,885 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:49:33,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps6.c [2025-03-17 15:49:34,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68872e22/24d9cfcb00544b0c87850cd4ef84671f/FLAG058e2e90b [2025-03-17 15:49:35,165 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:49:35,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps6.c [2025-03-17 15:49:35,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68872e22/24d9cfcb00544b0c87850cd4ef84671f/FLAG058e2e90b [2025-03-17 15:49:35,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68872e22/24d9cfcb00544b0c87850cd4ef84671f [2025-03-17 15:49:35,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:49:35,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:49:35,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:49:35,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:49:35,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:49:35,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bab302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35, skipping insertion in model container [2025-03-17 15:49:35,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:49:35,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:49:35,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:49:35,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:49:35,378 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:49:35,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35 WrapperNode [2025-03-17 15:49:35,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:49:35,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:49:35,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:49:35,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:49:35,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,416 INFO L138 Inliner]: procedures = 16, calls = 88, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2025-03-17 15:49:35,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:49:35,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:49:35,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:49:35,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:49:35,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,447 INFO L175 MemorySlicer]: Split 65 memory accesses to 6 slices as follows [2, 6, 5, 4, 45, 3]. 69 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0, 0, 0, 0]. The 7 writes are split as follows [0, 0, 2, 2, 2, 1]. [2025-03-17 15:49:35,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:49:35,463 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:49:35,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:49:35,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:49:35,464 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (1/1) ... [2025-03-17 15:49:35,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:49:35,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:35,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:49:35,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_33_0 [2025-03-17 15:49:35,507 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_33_0 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 15:49:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 15:49:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:49:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:49:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 15:49:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 15:49:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 15:49:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 15:49:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 15:49:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 15:49:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:49:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:49:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 15:49:35,597 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:49:35,599 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:49:36,135 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#k~0#1.base, main_~#k~0#1.offset);havoc main_~#k~0#1.base, main_~#k~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-17 15:49:36,160 INFO L? ?]: Removed 498 outVars from TransFormulas that were not future-live. [2025-03-17 15:49:36,160 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:49:36,171 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:49:36,171 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:49:36,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:49:36 BoogieIcfgContainer [2025-03-17 15:49:36,171 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:49:36,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:49:36,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:49:36,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:49:36,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:49:35" (1/3) ... [2025-03-17 15:49:36,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e12a988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:49:36, skipping insertion in model container [2025-03-17 15:49:36,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:35" (2/3) ... [2025-03-17 15:49:36,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e12a988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:49:36, skipping insertion in model container [2025-03-17 15:49:36,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:49:36" (3/3) ... [2025-03-17 15:49:36,177 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps6.c [2025-03-17 15:49:36,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:49:36,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps6.c that has 3 procedures, 226 locations, 1 initial locations, 0 loop locations, and 102 error locations. [2025-03-17 15:49:36,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:49:36,238 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;@2193d430, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:49:36,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-03-17 15:49:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 226 states, 116 states have (on average 1.9051724137931034) internal successors, (221), 219 states have internal predecessors, (221), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:49:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:49:36,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:36,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:49:36,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_25_to_33_0Err55ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:36,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash 242708201, now seen corresponding path program 1 times [2025-03-17 15:49:36,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:36,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100453620] [2025-03-17 15:49:36,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:36,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:49:36,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:49:36,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:36,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:36,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:36,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100453620] [2025-03-17 15:49:36,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100453620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:36,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:36,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:36,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638376746] [2025-03-17 15:49:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:36,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:36,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:36,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:36,680 INFO L87 Difference]: Start difference. First operand has 226 states, 116 states have (on average 1.9051724137931034) internal successors, (221), 219 states have internal predecessors, (221), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 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-03-17 15:49:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:37,058 INFO L93 Difference]: Finished difference Result 628 states and 660 transitions. [2025-03-17 15:49:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:37,061 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-03-17 15:49:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:37,069 INFO L225 Difference]: With dead ends: 628 [2025-03-17 15:49:37,070 INFO L226 Difference]: Without dead ends: 399 [2025-03-17 15:49:37,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-03-17 15:49:37,075 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 322 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:37,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 862 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-17 15:49:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 270. [2025-03-17 15:49:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.83125) internal successors, (293), 262 states have internal predecessors, (293), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 304 transitions. [2025-03-17 15:49:37,135 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 304 transitions. Word has length 5 [2025-03-17 15:49:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:37,136 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 304 transitions. [2025-03-17 15:49:37,137 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-03-17 15:49:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 304 transitions. [2025-03-17 15:49:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 15:49:37,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:37,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:37,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:49:37,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_33_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:37,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:37,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1790392035, now seen corresponding path program 1 times [2025-03-17 15:49:37,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:37,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506367552] [2025-03-17 15:49:37,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:37,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:37,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:49:37,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:49:37,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:37,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:37,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:37,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506367552] [2025-03-17 15:49:37,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506367552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:37,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:37,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:37,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392563797] [2025-03-17 15:49:37,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:37,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:37,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:37,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:37,348 INFO L87 Difference]: Start difference. First operand 270 states and 304 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-03-17 15:49:37,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:37,653 INFO L93 Difference]: Finished difference Result 399 states and 404 transitions. [2025-03-17 15:49:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:37,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 17 [2025-03-17 15:49:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:37,656 INFO L225 Difference]: With dead ends: 399 [2025-03-17 15:49:37,656 INFO L226 Difference]: Without dead ends: 389 [2025-03-17 15:49:37,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-03-17 15:49:37,657 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 268 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:37,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 832 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-17 15:49:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 270. [2025-03-17 15:49:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.76875) internal successors, (283), 262 states have internal predecessors, (283), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 294 transitions. [2025-03-17 15:49:37,670 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 294 transitions. Word has length 17 [2025-03-17 15:49:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:37,671 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 294 transitions. [2025-03-17 15:49:37,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-03-17 15:49:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 294 transitions. [2025-03-17 15:49:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 15:49:37,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:37,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:37,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:49:37,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_33_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:37,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1186959091, now seen corresponding path program 1 times [2025-03-17 15:49:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:37,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22291778] [2025-03-17 15:49:37,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:37,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 15:49:37,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 15:49:37,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:37,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:37,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64455969] [2025-03-17 15:49:37,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:37,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:37,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:37,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:37,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:49:37,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 15:49:37,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 15:49:37,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:37,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:37,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 15:49:37,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:37,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:37,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:37,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:37,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22291778] [2025-03-17 15:49:37,955 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:37,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64455969] [2025-03-17 15:49:37,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64455969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:37,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:37,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:37,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765469380] [2025-03-17 15:49:37,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:37,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:37,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:37,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:37,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:37,958 INFO L87 Difference]: Start difference. First operand 270 states and 294 transitions. Second operand has 7 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-03-17 15:49:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:38,222 INFO L93 Difference]: Finished difference Result 389 states and 394 transitions. [2025-03-17 15:49:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:38,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 27 [2025-03-17 15:49:38,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:38,224 INFO L225 Difference]: With dead ends: 389 [2025-03-17 15:49:38,224 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 15:49:38,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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-03-17 15:49:38,226 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 281 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:38,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 865 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 15:49:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 270. [2025-03-17 15:49:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.75625) internal successors, (281), 262 states have internal predecessors, (281), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 292 transitions. [2025-03-17 15:49:38,242 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 292 transitions. Word has length 27 [2025-03-17 15:49:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:38,242 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 292 transitions. [2025-03-17 15:49:38,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-03-17 15:49:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 292 transitions. [2025-03-17 15:49:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 15:49:38,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:38,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:38,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 15:49:38,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:38,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_33_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:38,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1793612975, now seen corresponding path program 1 times [2025-03-17 15:49:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:38,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432488999] [2025-03-17 15:49:38,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:38,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:49:38,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:49:38,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:38,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:38,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432488999] [2025-03-17 15:49:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432488999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:38,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:38,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065733736] [2025-03-17 15:49:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:38,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:38,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:38,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:38,635 INFO L87 Difference]: Start difference. First operand 270 states and 292 transitions. Second operand has 6 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-03-17 15:49:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:38,900 INFO L93 Difference]: Finished difference Result 387 states and 392 transitions. [2025-03-17 15:49:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:38,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 29 [2025-03-17 15:49:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:38,902 INFO L225 Difference]: With dead ends: 387 [2025-03-17 15:49:38,902 INFO L226 Difference]: Without dead ends: 386 [2025-03-17 15:49:38,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-03-17 15:49:38,902 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 230 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:38,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 829 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-17 15:49:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 270. [2025-03-17 15:49:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.75) internal successors, (280), 262 states have internal predecessors, (280), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 291 transitions. [2025-03-17 15:49:38,916 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 291 transitions. Word has length 29 [2025-03-17 15:49:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:38,916 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 291 transitions. [2025-03-17 15:49:38,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-03-17 15:49:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 291 transitions. [2025-03-17 15:49:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 15:49:38,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:38,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:38,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:49:38,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_33_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:38,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 232572660, now seen corresponding path program 1 times [2025-03-17 15:49:38,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:38,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636774764] [2025-03-17 15:49:38,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:38,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:38,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:49:38,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:49:38,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:38,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:39,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:39,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636774764] [2025-03-17 15:49:39,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636774764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:39,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:39,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:39,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298293029] [2025-03-17 15:49:39,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:39,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:39,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:39,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:39,077 INFO L87 Difference]: Start difference. First operand 270 states and 291 transitions. Second operand has 6 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-03-17 15:49:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:39,286 INFO L93 Difference]: Finished difference Result 386 states and 391 transitions. [2025-03-17 15:49:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:39,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 30 [2025-03-17 15:49:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:39,291 INFO L225 Difference]: With dead ends: 386 [2025-03-17 15:49:39,291 INFO L226 Difference]: Without dead ends: 379 [2025-03-17 15:49:39,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-03-17 15:49:39,292 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 215 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:39,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 843 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-17 15:49:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 270. [2025-03-17 15:49:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.70625) internal successors, (273), 262 states have internal predecessors, (273), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 284 transitions. [2025-03-17 15:49:39,301 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 284 transitions. Word has length 30 [2025-03-17 15:49:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:39,301 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 284 transitions. [2025-03-17 15:49:39,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-03-17 15:49:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 284 transitions. [2025-03-17 15:49:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 15:49:39,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:39,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:39,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:49:39,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_33_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:39,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:39,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2088520503, now seen corresponding path program 1 times [2025-03-17 15:49:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:39,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199185333] [2025-03-17 15:49:39,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:39,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:49:39,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:49:39,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:39,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:39,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482674813] [2025-03-17 15:49:39,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:39,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:39,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:39,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:39,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:49:39,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:49:39,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:49:39,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:39,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:39,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 15:49:39,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:39,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:39,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199185333] [2025-03-17 15:49:39,618 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482674813] [2025-03-17 15:49:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482674813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:39,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:39,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:49:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422142798] [2025-03-17 15:49:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:39,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:49:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:39,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:49:39,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:49:39,619 INFO L87 Difference]: Start difference. First operand 270 states and 284 transitions. Second operand has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-03-17 15:49:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:39,991 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2025-03-17 15:49:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:49:39,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 37 [2025-03-17 15:49:39,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:39,993 INFO L225 Difference]: With dead ends: 379 [2025-03-17 15:49:39,993 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 15:49:39,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:49:39,994 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 198 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:39,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1103 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 15:49:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 270. [2025-03-17 15:49:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.69375) internal successors, (271), 262 states have internal predecessors, (271), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 282 transitions. [2025-03-17 15:49:40,005 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 282 transitions. Word has length 37 [2025-03-17 15:49:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:40,006 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 282 transitions. [2025-03-17 15:49:40,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-03-17 15:49:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 282 transitions. [2025-03-17 15:49:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 15:49:40,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:40,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:40,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:49:40,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 15:49:40,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_25_to_33_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:40,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1318475481, now seen corresponding path program 1 times [2025-03-17 15:49:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:40,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463839112] [2025-03-17 15:49:40,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:49:40,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:49:40,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:40,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:40,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352082621] [2025-03-17 15:49:40,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:40,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:40,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:40,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:40,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:49:40,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:49:40,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:49:40,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:40,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:40,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 15:49:40,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:40,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:40,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:40,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463839112] [2025-03-17 15:49:40,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:40,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352082621] [2025-03-17 15:49:40,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352082621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:40,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785653847] [2025-03-17 15:49:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:40,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:40,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:40,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:40,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:40,370 INFO L87 Difference]: Start difference. First operand 270 states and 282 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-03-17 15:49:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:40,565 INFO L93 Difference]: Finished difference Result 377 states and 382 transitions. [2025-03-17 15:49:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:40,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 39 [2025-03-17 15:49:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:40,569 INFO L225 Difference]: With dead ends: 377 [2025-03-17 15:49:40,569 INFO L226 Difference]: Without dead ends: 375 [2025-03-17 15:49:40,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 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-03-17 15:49:40,570 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 186 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:40,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 867 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-17 15:49:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 270. [2025-03-17 15:49:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.68125) internal successors, (269), 262 states have internal predecessors, (269), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 280 transitions. [2025-03-17 15:49:40,575 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 280 transitions. Word has length 39 [2025-03-17 15:49:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:40,575 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 280 transitions. [2025-03-17 15:49:40,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-03-17 15:49:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 280 transitions. [2025-03-17 15:49:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 15:49:40,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:40,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:40,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:49:40,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:40,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_25_to_33_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:40,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash -39584379, now seen corresponding path program 1 times [2025-03-17 15:49:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:40,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677933474] [2025-03-17 15:49:40,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:40,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:40,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 15:49:40,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:49:40,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:40,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991543805] [2025-03-17 15:49:40,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:40,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:40,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:40,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:40,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:49:40,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 15:49:40,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 15:49:40,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:40,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:40,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 15:49:40,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:40,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:41,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:41,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:41,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677933474] [2025-03-17 15:49:41,038 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:41,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991543805] [2025-03-17 15:49:41,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991543805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:41,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:41,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:41,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429435420] [2025-03-17 15:49:41,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:41,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:49:41,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:41,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:49:41,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:49:41,039 INFO L87 Difference]: Start difference. First operand 270 states and 280 transitions. Second operand has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-03-17 15:49:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:41,438 INFO L93 Difference]: Finished difference Result 375 states and 380 transitions. [2025-03-17 15:49:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:49:41,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 41 [2025-03-17 15:49:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:41,440 INFO L225 Difference]: With dead ends: 375 [2025-03-17 15:49:41,440 INFO L226 Difference]: Without dead ends: 374 [2025-03-17 15:49:41,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:49:41,441 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 193 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:41,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 840 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-17 15:49:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 270. [2025-03-17 15:49:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.675) internal successors, (268), 262 states have internal predecessors, (268), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 279 transitions. [2025-03-17 15:49:41,447 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 279 transitions. Word has length 41 [2025-03-17 15:49:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:41,447 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 279 transitions. [2025-03-17 15:49:41,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-03-17 15:49:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 279 transitions. [2025-03-17 15:49:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:49:41,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:41,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:41,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:49:41,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:41,649 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_33_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:41,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1227115736, now seen corresponding path program 1 times [2025-03-17 15:49:41,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834160695] [2025-03-17 15:49:41,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:41,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:49:41,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:49:41,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:41,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:41,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844199256] [2025-03-17 15:49:41,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:41,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:41,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:41,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:49:41,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:49:41,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:49:41,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:41,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:41,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 15:49:41,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:41,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:41,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:41,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834160695] [2025-03-17 15:49:41,954 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844199256] [2025-03-17 15:49:41,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844199256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:41,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:41,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:41,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018898206] [2025-03-17 15:49:41,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:41,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:49:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:41,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:49:41,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:49:41,958 INFO L87 Difference]: Start difference. First operand 270 states and 279 transitions. Second operand has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-03-17 15:49:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:42,331 INFO L93 Difference]: Finished difference Result 374 states and 379 transitions. [2025-03-17 15:49:42,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:49:42,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 42 [2025-03-17 15:49:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:42,333 INFO L225 Difference]: With dead ends: 374 [2025-03-17 15:49:42,333 INFO L226 Difference]: Without dead ends: 373 [2025-03-17 15:49:42,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:49:42,333 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 202 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:42,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 831 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-17 15:49:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 270. [2025-03-17 15:49:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.66875) internal successors, (267), 262 states have internal predecessors, (267), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 278 transitions. [2025-03-17 15:49:42,339 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 278 transitions. Word has length 42 [2025-03-17 15:49:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:42,339 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 278 transitions. [2025-03-17 15:49:42,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-03-17 15:49:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 278 transitions. [2025-03-17 15:49:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 15:49:42,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:42,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:42,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:49:42,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:42,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_25_to_33_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:42,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash 614117859, now seen corresponding path program 1 times [2025-03-17 15:49:42,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:42,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408484343] [2025-03-17 15:49:42,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:42,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:42,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:49:42,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:49:42,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:42,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:42,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408484343] [2025-03-17 15:49:42,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408484343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:42,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:42,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833089318] [2025-03-17 15:49:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:42,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:42,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:42,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:42,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:42,689 INFO L87 Difference]: Start difference. First operand 270 states and 278 transitions. Second operand has 6 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-03-17 15:49:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:42,753 INFO L93 Difference]: Finished difference Result 379 states and 383 transitions. [2025-03-17 15:49:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:42,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 43 [2025-03-17 15:49:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:42,755 INFO L225 Difference]: With dead ends: 379 [2025-03-17 15:49:42,755 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 15:49:42,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-03-17 15:49:42,756 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 195 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:42,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1053 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:49:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 15:49:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 270. [2025-03-17 15:49:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.65625) internal successors, (265), 262 states have internal predecessors, (265), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 276 transitions. [2025-03-17 15:49:42,764 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 276 transitions. Word has length 43 [2025-03-17 15:49:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:42,764 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 276 transitions. [2025-03-17 15:49:42,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-03-17 15:49:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 276 transitions. [2025-03-17 15:49:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 15:49:42,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:42,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:42,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:49:42,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_25_to_33_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:42,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1756743233, now seen corresponding path program 1 times [2025-03-17 15:49:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:42,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345542349] [2025-03-17 15:49:42,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:42,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:49:42,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:49:42,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:42,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:42,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345542349] [2025-03-17 15:49:43,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345542349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:43,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:43,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:43,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680923536] [2025-03-17 15:49:43,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:43,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:43,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:43,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:43,001 INFO L87 Difference]: Start difference. First operand 270 states and 276 transitions. Second operand has 7 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03-17 15:49:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:43,313 INFO L93 Difference]: Finished difference Result 377 states and 381 transitions. [2025-03-17 15:49:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:43,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 45 [2025-03-17 15:49:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:43,315 INFO L225 Difference]: With dead ends: 377 [2025-03-17 15:49:43,315 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 15:49:43,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:43,316 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 196 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:43,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1008 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 15:49:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 270. [2025-03-17 15:49:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.65) internal successors, (264), 262 states have internal predecessors, (264), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 275 transitions. [2025-03-17 15:49:43,322 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 275 transitions. Word has length 45 [2025-03-17 15:49:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:43,322 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 275 transitions. [2025-03-17 15:49:43,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-03-17 15:49:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 275 transitions. [2025-03-17 15:49:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 15:49:43,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:43,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:43,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:49:43,323 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_25_to_33_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:43,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1375534620, now seen corresponding path program 1 times [2025-03-17 15:49:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642665368] [2025-03-17 15:49:43,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:43,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 15:49:43,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 15:49:43,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:43,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:43,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:43,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642665368] [2025-03-17 15:49:43,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642665368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:43,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:43,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298817215] [2025-03-17 15:49:43,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:43,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:43,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:43,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:43,464 INFO L87 Difference]: Start difference. First operand 270 states and 275 transitions. Second operand has 6 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-17 15:49:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:43,740 INFO L93 Difference]: Finished difference Result 376 states and 380 transitions. [2025-03-17 15:49:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 46 [2025-03-17 15:49:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:43,742 INFO L225 Difference]: With dead ends: 376 [2025-03-17 15:49:43,742 INFO L226 Difference]: Without dead ends: 375 [2025-03-17 15:49:43,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-03-17 15:49:43,743 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 188 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:43,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 981 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-17 15:49:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 270. [2025-03-17 15:49:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 160 states have (on average 1.64375) internal successors, (263), 262 states have internal predecessors, (263), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 274 transitions. [2025-03-17 15:49:43,750 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 274 transitions. Word has length 46 [2025-03-17 15:49:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:43,750 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 274 transitions. [2025-03-17 15:49:43,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-17 15:49:43,751 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 274 transitions. [2025-03-17 15:49:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 15:49:43,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:43,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:43,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:49:43,751 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_25_to_33_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1986042731, now seen corresponding path program 1 times [2025-03-17 15:49:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243896771] [2025-03-17 15:49:43,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:43,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 15:49:43,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 15:49:43,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:43,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243896771] [2025-03-17 15:49:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243896771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:43,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:43,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074837697] [2025-03-17 15:49:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:43,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:43,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:43,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:43,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:43,919 INFO L87 Difference]: Start difference. First operand 270 states and 274 transitions. Second operand has 7 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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-03-17 15:49:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:43,987 INFO L93 Difference]: Finished difference Result 369 states and 373 transitions. [2025-03-17 15:49:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:43,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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 54 [2025-03-17 15:49:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:43,989 INFO L225 Difference]: With dead ends: 369 [2025-03-17 15:49:43,989 INFO L226 Difference]: Without dead ends: 368 [2025-03-17 15:49:43,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:43,990 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 149 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:43,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1273 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:49:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-17 15:49:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 271. [2025-03-17 15:49:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.639751552795031) internal successors, (264), 263 states have internal predecessors, (264), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 275 transitions. [2025-03-17 15:49:44,011 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 275 transitions. Word has length 54 [2025-03-17 15:49:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:44,011 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 275 transitions. [2025-03-17 15:49:44,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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-03-17 15:49:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 275 transitions. [2025-03-17 15:49:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 15:49:44,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:44,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:44,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:49:44,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_25_to_33_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:44,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1437782522, now seen corresponding path program 1 times [2025-03-17 15:49:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:44,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368242841] [2025-03-17 15:49:44,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:44,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:49:44,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:49:44,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:44,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:44,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:44,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368242841] [2025-03-17 15:49:44,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368242841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:44,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:44,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:44,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87354358] [2025-03-17 15:49:44,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:44,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:44,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:44,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:44,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:44,191 INFO L87 Difference]: Start difference. First operand 271 states and 275 transitions. Second operand has 7 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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-03-17 15:49:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:44,262 INFO L93 Difference]: Finished difference Result 271 states and 275 transitions. [2025-03-17 15:49:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:44,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 55 [2025-03-17 15:49:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:44,264 INFO L225 Difference]: With dead ends: 271 [2025-03-17 15:49:44,264 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 15:49:44,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:44,265 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 275 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:44,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 943 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:49:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 15:49:44,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-17 15:49:44,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 161 states have (on average 1.6335403726708075) internal successors, (263), 262 states have internal predecessors, (263), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 274 transitions. [2025-03-17 15:49:44,270 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 274 transitions. Word has length 55 [2025-03-17 15:49:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:44,271 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 274 transitions. [2025-03-17 15:49:44,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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-03-17 15:49:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 274 transitions. [2025-03-17 15:49:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 15:49:44,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:44,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:44,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:49:44,272 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_25_to_33_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:44,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:44,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1621585229, now seen corresponding path program 1 times [2025-03-17 15:49:44,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:44,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936924489] [2025-03-17 15:49:44,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:44,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:44,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 15:49:44,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 15:49:44,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:44,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:44,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936924489] [2025-03-17 15:49:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936924489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956783027] [2025-03-17 15:49:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:44,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:44,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:44,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:44,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:44,426 INFO L87 Difference]: Start difference. First operand 270 states and 274 transitions. Second operand has 6 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-03-17 15:49:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:44,564 INFO L93 Difference]: Finished difference Result 366 states and 371 transitions. [2025-03-17 15:49:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 56 [2025-03-17 15:49:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:44,566 INFO L225 Difference]: With dead ends: 366 [2025-03-17 15:49:44,566 INFO L226 Difference]: Without dead ends: 364 [2025-03-17 15:49:44,566 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-03-17 15:49:44,567 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 145 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:44,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 890 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-17 15:49:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 273. [2025-03-17 15:49:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 164 states have (on average 1.6219512195121952) internal successors, (266), 265 states have internal predecessors, (266), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 277 transitions. [2025-03-17 15:49:44,573 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 277 transitions. Word has length 56 [2025-03-17 15:49:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:44,573 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 277 transitions. [2025-03-17 15:49:44,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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-03-17 15:49:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 277 transitions. [2025-03-17 15:49:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 15:49:44,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:44,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:44,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 15:49:44,574 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:44,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1271660569, now seen corresponding path program 1 times [2025-03-17 15:49:44,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:44,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630416585] [2025-03-17 15:49:44,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:44,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:44,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 15:49:44,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 15:49:44,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:44,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:44,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:44,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630416585] [2025-03-17 15:49:44,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630416585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:44,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:44,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:44,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346217365] [2025-03-17 15:49:44,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:44,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:49:44,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:44,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:49:44,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:49:44,659 INFO L87 Difference]: Start difference. First operand 273 states and 277 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:44,881 INFO L93 Difference]: Finished difference Result 366 states and 371 transitions. [2025-03-17 15:49:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:49:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2025-03-17 15:49:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:44,882 INFO L225 Difference]: With dead ends: 366 [2025-03-17 15:49:44,882 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 15:49:44,883 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-03-17 15:49:44,883 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 193 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:44,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 559 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 15:49:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 288. [2025-03-17 15:49:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 178 states have (on average 1.5730337078651686) internal successors, (280), 278 states have internal predecessors, (280), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-17 15:49:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 292 transitions. [2025-03-17 15:49:44,891 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 292 transitions. Word has length 57 [2025-03-17 15:49:44,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:44,891 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 292 transitions. [2025-03-17 15:49:44,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 292 transitions. [2025-03-17 15:49:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 15:49:44,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:44,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:44,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 15:49:44,892 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_25_to_33_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:44,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash 729723089, now seen corresponding path program 1 times [2025-03-17 15:49:44,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:44,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888566526] [2025-03-17 15:49:44,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:44,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 15:49:44,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 15:49:44,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:44,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:44,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735740463] [2025-03-17 15:49:44,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:44,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:44,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:44,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:44,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:49:44,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 15:49:44,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 15:49:44,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:44,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:44,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 15:49:44,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:45,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 15:49:45,123 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 26 treesize of output 14 [2025-03-17 15:49:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:45,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:45,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:45,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888566526] [2025-03-17 15:49:45,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735740463] [2025-03-17 15:49:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735740463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:45,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:45,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056567501] [2025-03-17 15:49:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:45,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:49:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:45,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:49:45,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:49:45,137 INFO L87 Difference]: Start difference. First operand 288 states and 292 transitions. Second operand has 8 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-03-17 15:49:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:45,384 INFO L93 Difference]: Finished difference Result 356 states and 362 transitions. [2025-03-17 15:49:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:49:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 58 [2025-03-17 15:49:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:45,386 INFO L225 Difference]: With dead ends: 356 [2025-03-17 15:49:45,386 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 15:49:45,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:49:45,387 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 509 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:45,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 779 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 15:49:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 286. [2025-03-17 15:49:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 178 states have (on average 1.5617977528089888) internal successors, (278), 276 states have internal predecessors, (278), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-17 15:49:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 290 transitions. [2025-03-17 15:49:45,395 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 290 transitions. Word has length 58 [2025-03-17 15:49:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:45,395 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 290 transitions. [2025-03-17 15:49:45,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-03-17 15:49:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 290 transitions. [2025-03-17 15:49:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 15:49:45,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:45,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:45,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 15:49:45,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 15:49:45,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_25_to_33_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:45,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1146579266, now seen corresponding path program 1 times [2025-03-17 15:49:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:45,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292837293] [2025-03-17 15:49:45,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:45,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 15:49:45,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 15:49:45,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:45,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:45,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876844655] [2025-03-17 15:49:45,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:45,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:45,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:45,617 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:45,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:49:45,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 15:49:45,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 15:49:45,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:45,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:45,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:49:45,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:45,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:45,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:45,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292837293] [2025-03-17 15:49:45,828 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876844655] [2025-03-17 15:49:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876844655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:45,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:45,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21804617] [2025-03-17 15:49:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:45,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:49:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:45,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:49:45,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:49:45,829 INFO L87 Difference]: Start difference. First operand 286 states and 290 transitions. Second operand has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-03-17 15:49:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:46,042 INFO L93 Difference]: Finished difference Result 371 states and 382 transitions. [2025-03-17 15:49:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:49:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 59 [2025-03-17 15:49:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:46,044 INFO L225 Difference]: With dead ends: 371 [2025-03-17 15:49:46,044 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 15:49:46,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:46,045 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 222 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:46,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 753 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 15:49:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 323. [2025-03-17 15:49:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 213 states have (on average 1.6103286384976525) internal successors, (343), 312 states have internal predecessors, (343), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 357 transitions. [2025-03-17 15:49:46,051 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 357 transitions. Word has length 59 [2025-03-17 15:49:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:46,052 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 357 transitions. [2025-03-17 15:49:46,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-03-17 15:49:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 357 transitions. [2025-03-17 15:49:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 15:49:46,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:46,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:46,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:49:46,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:46,257 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_25_to_33_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:46,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1184218863, now seen corresponding path program 1 times [2025-03-17 15:49:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-03-17 15:49:46,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:46,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 15:49:46,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 15:49:46,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:46,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488961428] [2025-03-17 15:49:46,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:46,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:46,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:46,295 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:46,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:49:46,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 15:49:46,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 15:49:46,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:46,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:46,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 15:49:46,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:46,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 15:49:46,480 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 36 treesize of output 13 [2025-03-17 15:49:46,505 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 29 treesize of output 13 [2025-03-17 15:49:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:46,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:46,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-03-17 15:49:46,519 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:46,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488961428] [2025-03-17 15:49:46,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488961428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:46,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:49:46,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911203204] [2025-03-17 15:49:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:46,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:49:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:46,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:49:46,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:49:46,520 INFO L87 Difference]: Start difference. First operand 323 states and 357 transitions. Second operand has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-03-17 15:49:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:46,829 INFO L93 Difference]: Finished difference Result 360 states and 365 transitions. [2025-03-17 15:49:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:49:46,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 60 [2025-03-17 15:49:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:46,832 INFO L225 Difference]: With dead ends: 360 [2025-03-17 15:49:46,832 INFO L226 Difference]: Without dead ends: 359 [2025-03-17 15:49:46,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:49:46,832 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 360 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:46,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 932 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-17 15:49:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 322. [2025-03-17 15:49:46,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 213 states have (on average 1.6056338028169015) internal successors, (342), 311 states have internal predecessors, (342), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 356 transitions. [2025-03-17 15:49:46,842 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 356 transitions. Word has length 60 [2025-03-17 15:49:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:46,842 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 356 transitions. [2025-03-17 15:49:46,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-03-17 15:49:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 356 transitions. [2025-03-17 15:49:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:49:46,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:46,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:46,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 15:49:47,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:47,043 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_25_to_33_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:47,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1943920928, now seen corresponding path program 1 times [2025-03-17 15:49:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:47,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499089254] [2025-03-17 15:49:47,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:47,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:47,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:49:47,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:49:47,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:47,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:47,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781775638] [2025-03-17 15:49:47,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:47,063 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:47,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:49:47,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:49:47,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:49:47,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:47,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:47,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 15:49:47,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:47,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:47,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 15:49:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:47,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:47,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499089254] [2025-03-17 15:49:47,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781775638] [2025-03-17 15:49:47,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781775638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:47,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:49:47,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316509944] [2025-03-17 15:49:47,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:47,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:49:47,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:47,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:49:47,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:49:47,280 INFO L87 Difference]: Start difference. First operand 322 states and 356 transitions. Second operand has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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-03-17 15:49:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:47,591 INFO L93 Difference]: Finished difference Result 370 states and 379 transitions. [2025-03-17 15:49:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:49:47,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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 61 [2025-03-17 15:49:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:47,592 INFO L225 Difference]: With dead ends: 370 [2025-03-17 15:49:47,592 INFO L226 Difference]: Without dead ends: 369 [2025-03-17 15:49:47,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:49:47,593 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 148 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:47,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1185 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-17 15:49:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 324. [2025-03-17 15:49:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 215 states have (on average 1.6) internal successors, (344), 313 states have internal predecessors, (344), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 358 transitions. [2025-03-17 15:49:47,599 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 358 transitions. Word has length 61 [2025-03-17 15:49:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:47,600 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 358 transitions. [2025-03-17 15:49:47,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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-03-17 15:49:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 358 transitions. [2025-03-17 15:49:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 15:49:47,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:47,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:47,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 15:49:47,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:47,805 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_25_to_33_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:47,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash -132006643, now seen corresponding path program 1 times [2025-03-17 15:49:47,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:47,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868836829] [2025-03-17 15:49:47,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:47,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:49:47,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:49:47,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:47,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422079032] [2025-03-17 15:49:47,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:47,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:47,825 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:47,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 15:49:47,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:49:47,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:49:47,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:47,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:47,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 15:49:47,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 15:49:48,009 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 36 treesize of output 13 [2025-03-17 15:49:48,053 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 36 treesize of output 16 [2025-03-17 15:49:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:48,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:48,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:48,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868836829] [2025-03-17 15:49:48,067 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:48,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422079032] [2025-03-17 15:49:48,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422079032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:48,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:48,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 15:49:48,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971440204] [2025-03-17 15:49:48,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:48,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:49:48,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:48,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:49:48,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:48,068 INFO L87 Difference]: Start difference. First operand 324 states and 358 transitions. Second operand has 10 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-03-17 15:49:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:48,387 INFO L93 Difference]: Finished difference Result 361 states and 366 transitions. [2025-03-17 15:49:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:49:48,387 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 62 [2025-03-17 15:49:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:48,388 INFO L225 Difference]: With dead ends: 361 [2025-03-17 15:49:48,388 INFO L226 Difference]: Without dead ends: 360 [2025-03-17 15:49:48,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:49:48,389 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 355 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:48,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1085 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-17 15:49:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 323. [2025-03-17 15:49:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 215 states have (on average 1.5953488372093023) internal successors, (343), 312 states have internal predecessors, (343), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 357 transitions. [2025-03-17 15:49:48,398 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 357 transitions. Word has length 62 [2025-03-17 15:49:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:48,399 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 357 transitions. [2025-03-17 15:49:48,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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-03-17 15:49:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 357 transitions. [2025-03-17 15:49:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 15:49:48,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:48,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:48,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 15:49:48,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 15:49:48,600 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_25_to_33_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:48,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 202761342, now seen corresponding path program 1 times [2025-03-17 15:49:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:48,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062888728] [2025-03-17 15:49:48,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:48,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 15:49:48,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 15:49:48,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:48,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:48,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2082445281] [2025-03-17 15:49:48,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:48,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:48,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:48,623 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:48,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 15:49:48,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 15:49:48,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 15:49:48,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:48,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:48,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 15:49:48,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:48,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:48,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 15:49:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:48,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:48,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:48,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062888728] [2025-03-17 15:49:48,872 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:48,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082445281] [2025-03-17 15:49:48,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082445281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:48,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:48,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 15:49:48,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051955484] [2025-03-17 15:49:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:48,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:49:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:48,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:49:48,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:48,873 INFO L87 Difference]: Start difference. First operand 323 states and 357 transitions. Second operand has 10 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-03-17 15:49:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:49,194 INFO L93 Difference]: Finished difference Result 369 states and 376 transitions. [2025-03-17 15:49:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:49:49,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 63 [2025-03-17 15:49:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:49,198 INFO L225 Difference]: With dead ends: 369 [2025-03-17 15:49:49,199 INFO L226 Difference]: Without dead ends: 368 [2025-03-17 15:49:49,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:49:49,200 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 144 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:49,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1440 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-17 15:49:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 325. [2025-03-17 15:49:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 314 states have internal predecessors, (345), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 359 transitions. [2025-03-17 15:49:49,206 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 359 transitions. Word has length 63 [2025-03-17 15:49:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:49,207 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 359 transitions. [2025-03-17 15:49:49,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-03-17 15:49:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 359 transitions. [2025-03-17 15:49:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 15:49:49,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:49,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:49,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 15:49:49,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 15:49:49,408 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_25_to_33_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:49,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1990634283, now seen corresponding path program 1 times [2025-03-17 15:49:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:49,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229824090] [2025-03-17 15:49:49,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:49,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 15:49:49,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:49:49,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:49,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:49,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604446550] [2025-03-17 15:49:49,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:49,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:49,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:49,427 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:49,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 15:49:49,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 15:49:49,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:49:49,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:49,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:49,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:49:49,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:49,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 15:49:49,606 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 36 treesize of output 13 [2025-03-17 15:49:49,674 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 43 treesize of output 19 [2025-03-17 15:49:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:49,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:49,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:49,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229824090] [2025-03-17 15:49:49,693 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:49,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604446550] [2025-03-17 15:49:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604446550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:49,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 15:49:49,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562029412] [2025-03-17 15:49:49,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:49,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:49:49,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:49,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:49:49,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:49:49,694 INFO L87 Difference]: Start difference. First operand 325 states and 359 transitions. Second operand has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-03-17 15:49:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:49,951 INFO L93 Difference]: Finished difference Result 362 states and 367 transitions. [2025-03-17 15:49:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:49:49,951 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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 64 [2025-03-17 15:49:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:49,953 INFO L225 Difference]: With dead ends: 362 [2025-03-17 15:49:49,953 INFO L226 Difference]: Without dead ends: 361 [2025-03-17 15:49:49,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:49:49,954 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 352 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:49,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1007 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-17 15:49:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 324. [2025-03-17 15:49:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 313 states have internal predecessors, (344), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 358 transitions. [2025-03-17 15:49:49,963 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 358 transitions. Word has length 64 [2025-03-17 15:49:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:49,963 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 358 transitions. [2025-03-17 15:49:49,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 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-03-17 15:49:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 358 transitions. [2025-03-17 15:49:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:49:49,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:49,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:49,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 15:49:50,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-17 15:49:50,165 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_25_to_33_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:50,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1580120604, now seen corresponding path program 1 times [2025-03-17 15:49:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:50,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186907422] [2025-03-17 15:49:50,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:50,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:50,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:49:50,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:49:50,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:50,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:50,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796039801] [2025-03-17 15:49:50,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:50,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:50,190 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:50,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 15:49:50,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:49:50,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:49:50,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:50,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:50,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 15:49:50,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:50,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:50,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:50,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 15:49:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:50,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:50,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:50,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186907422] [2025-03-17 15:49:50,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:50,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796039801] [2025-03-17 15:49:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796039801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:50,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 15:49:50,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595719028] [2025-03-17 15:49:50,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:49:50,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:50,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:49:50,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:49:50,577 INFO L87 Difference]: Start difference. First operand 324 states and 358 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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-03-17 15:49:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:50,886 INFO L93 Difference]: Finished difference Result 368 states and 373 transitions. [2025-03-17 15:49:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:49:50,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 65 [2025-03-17 15:49:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:50,888 INFO L225 Difference]: With dead ends: 368 [2025-03-17 15:49:50,888 INFO L226 Difference]: Without dead ends: 367 [2025-03-17 15:49:50,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:49:50,888 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 144 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:50,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1587 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-17 15:49:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 326. [2025-03-17 15:49:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 219 states have (on average 1.5799086757990868) internal successors, (346), 315 states have internal predecessors, (346), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 360 transitions. [2025-03-17 15:49:50,895 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 360 transitions. Word has length 65 [2025-03-17 15:49:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:50,895 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 360 transitions. [2025-03-17 15:49:50,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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-03-17 15:49:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 360 transitions. [2025-03-17 15:49:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:49:50,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:50,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:50,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 15:49:51,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 15:49:51,096 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:51,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1739098441, now seen corresponding path program 1 times [2025-03-17 15:49:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:51,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873624638] [2025-03-17 15:49:51,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:51,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:49:51,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:49:51,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:51,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873624638] [2025-03-17 15:49:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873624638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139887841] [2025-03-17 15:49:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:51,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:51,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:51,253 INFO L87 Difference]: Start difference. First operand 326 states and 360 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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-03-17 15:49:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:51,422 INFO L93 Difference]: Finished difference Result 356 states and 364 transitions. [2025-03-17 15:49:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:51,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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 66 [2025-03-17 15:49:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:51,424 INFO L225 Difference]: With dead ends: 356 [2025-03-17 15:49:51,424 INFO L226 Difference]: Without dead ends: 355 [2025-03-17 15:49:51,424 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-03-17 15:49:51,425 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 132 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:51,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1217 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-17 15:49:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 327. [2025-03-17 15:49:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 316 states have internal predecessors, (347), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 361 transitions. [2025-03-17 15:49:51,431 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 361 transitions. Word has length 66 [2025-03-17 15:49:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:51,432 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 361 transitions. [2025-03-17 15:49:51,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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-03-17 15:49:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 361 transitions. [2025-03-17 15:49:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 15:49:51,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:51,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:51,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 15:49:51,433 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:51,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1922523206, now seen corresponding path program 1 times [2025-03-17 15:49:51,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:51,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319273263] [2025-03-17 15:49:51,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:51,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:51,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 15:49:51,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:49:51,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:51,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:51,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:51,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319273263] [2025-03-17 15:49:51,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319273263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:51,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:51,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:51,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643203249] [2025-03-17 15:49:51,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:51,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:51,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:51,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:51,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:51,570 INFO L87 Difference]: Start difference. First operand 327 states and 361 transitions. Second operand has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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-03-17 15:49:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:51,679 INFO L93 Difference]: Finished difference Result 355 states and 363 transitions. [2025-03-17 15:49:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:51,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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 67 [2025-03-17 15:49:51,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:51,680 INFO L225 Difference]: With dead ends: 355 [2025-03-17 15:49:51,680 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 15:49:51,681 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-03-17 15:49:51,681 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 129 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:51,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1027 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 15:49:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 328. [2025-03-17 15:49:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 221 states have (on average 1.5746606334841629) internal successors, (348), 317 states have internal predecessors, (348), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 362 transitions. [2025-03-17 15:49:51,689 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 362 transitions. Word has length 67 [2025-03-17 15:49:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:51,689 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 362 transitions. [2025-03-17 15:49:51,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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-03-17 15:49:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 362 transitions. [2025-03-17 15:49:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 15:49:51,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:51,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:51,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 15:49:51,690 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:51,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash 524916621, now seen corresponding path program 1 times [2025-03-17 15:49:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:51,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97999643] [2025-03-17 15:49:51,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:51,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:51,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 15:49:51,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:49:51,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:51,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97999643] [2025-03-17 15:49:51,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97999643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:51,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:51,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47954943] [2025-03-17 15:49:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:51,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:49:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:51,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:49:51,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:49:51,771 INFO L87 Difference]: Start difference. First operand 328 states and 362 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:51,952 INFO L93 Difference]: Finished difference Result 363 states and 367 transitions. [2025-03-17 15:49:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:49:51,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2025-03-17 15:49:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:51,953 INFO L225 Difference]: With dead ends: 363 [2025-03-17 15:49:51,953 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 15:49:51,954 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-03-17 15:49:51,954 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 148 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:51,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 538 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 15:49:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 328. [2025-03-17 15:49:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 221 states have (on average 1.5294117647058822) internal successors, (338), 317 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 352 transitions. [2025-03-17 15:49:51,960 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 352 transitions. Word has length 69 [2025-03-17 15:49:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 352 transitions. [2025-03-17 15:49:51,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 352 transitions. [2025-03-17 15:49:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 15:49:51,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:51,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:51,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 15:49:51,960 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_25_to_33_0Err55ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:49:51,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1687846315, now seen corresponding path program 1 times [2025-03-17 15:49:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:51,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677861868] [2025-03-17 15:49:51,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:51,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 15:49:51,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 15:49:51,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:51,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677861868] [2025-03-17 15:49:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677861868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:49:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609505331] [2025-03-17 15:49:52,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:52,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:52,203 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:49:52,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 15:49:52,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 15:49:52,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 15:49:52,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:52,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:52,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:49:52,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:52,407 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 36 treesize of output 13 [2025-03-17 15:49:52,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 15:49:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:52,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:52,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609505331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:52,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:49:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-17 15:49:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244784544] [2025-03-17 15:49:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:52,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:49:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:52,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:49:52,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:49:52,453 INFO L87 Difference]: Start difference. First operand 328 states and 352 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:56,580 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-03-17 15:50:00,932 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-03-17 15:50:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:00,959 INFO L93 Difference]: Finished difference Result 331 states and 359 transitions. [2025-03-17 15:50:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 15:50:00,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2025-03-17 15:50:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:00,961 INFO L225 Difference]: With dead ends: 331 [2025-03-17 15:50:00,961 INFO L226 Difference]: Without dead ends: 329 [2025-03-17 15:50:00,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-03-17 15:50:00,961 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 457 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:00,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 645 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 507 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-03-17 15:50:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-17 15:50:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2025-03-17 15:50:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 221 states have (on average 1.5203619909502262) internal successors, (336), 315 states have internal predecessors, (336), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:50:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 350 transitions. [2025-03-17 15:50:00,968 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 350 transitions. Word has length 71 [2025-03-17 15:50:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:00,968 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 350 transitions. [2025-03-17 15:50:00,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:50:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 350 transitions. [2025-03-17 15:50:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 15:50:00,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:00,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:00,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:01,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:01,170 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting func_to_recursive_line_25_to_33_0Err54ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:50:01,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash 783628298, now seen corresponding path program 1 times [2025-03-17 15:50:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:01,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766571878] [2025-03-17 15:50:01,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:01,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 15:50:01,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 15:50:01,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:01,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:01,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766571878] [2025-03-17 15:50:01,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766571878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624245221] [2025-03-17 15:50:01,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:01,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:01,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:01,393 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:01,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 15:50:01,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 15:50:01,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 15:50:01,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:01,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:01,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:50:01,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:01,576 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-03-17 15:50:01,607 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-03-17 15:50:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:01,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624245221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:50:01,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:50:01,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-03-17 15:50:01,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518749342] [2025-03-17 15:50:01,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:01,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:50:01,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:01,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:50:01,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:50:01,837 INFO L87 Difference]: Start difference. First operand 326 states and 350 transitions. Second operand has 21 states, 19 states have (on average 10.473684210526315) internal successors, (199), 17 states have internal predecessors, (199), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:50:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:02,407 INFO L93 Difference]: Finished difference Result 354 states and 362 transitions. [2025-03-17 15:50:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:50:02,407 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 10.473684210526315) internal successors, (199), 17 states have internal predecessors, (199), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 72 [2025-03-17 15:50:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:02,408 INFO L225 Difference]: With dead ends: 354 [2025-03-17 15:50:02,408 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 15:50:02,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2025-03-17 15:50:02,409 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1026 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:02,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1300 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 15:50:02,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 15:50:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 325. [2025-03-17 15:50:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 221 states have (on average 1.5158371040723981) internal successors, (335), 314 states have internal predecessors, (335), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:50:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 349 transitions. [2025-03-17 15:50:02,416 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 349 transitions. Word has length 72 [2025-03-17 15:50:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:02,417 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 349 transitions. [2025-03-17 15:50:02,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 10.473684210526315) internal successors, (199), 17 states have internal predecessors, (199), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:50:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 349 transitions. [2025-03-17 15:50:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 15:50:02,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:02,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:02,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:02,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 15:50:02,618 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting func_to_recursive_line_25_to_33_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:50:02,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1477326455, now seen corresponding path program 1 times [2025-03-17 15:50:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039711257] [2025-03-17 15:50:02,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:02,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:50:02,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:50:02,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:02,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:02,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272317681] [2025-03-17 15:50:02,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:02,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:02,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:02,646 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:02,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 15:50:02,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:50:02,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:50:02,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:02,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:02,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 15:50:02,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:02,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:50:02,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 15:50:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:02,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:03,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:03,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039711257] [2025-03-17 15:50:03,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272317681] [2025-03-17 15:50:03,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272317681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:03,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:50:03,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-17 15:50:03,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836457123] [2025-03-17 15:50:03,979 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:03,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:50:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:03,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:50:03,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=221, Unknown=1, NotChecked=0, Total=272 [2025-03-17 15:50:03,980 INFO L87 Difference]: Start difference. First operand 325 states and 349 transitions. Second operand has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:50:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:04,367 INFO L93 Difference]: Finished difference Result 451 states and 457 transitions. [2025-03-17 15:50:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:50:04,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-03-17 15:50:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:04,368 INFO L225 Difference]: With dead ends: 451 [2025-03-17 15:50:04,368 INFO L226 Difference]: Without dead ends: 450 [2025-03-17 15:50:04,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=362, Unknown=1, NotChecked=0, Total=462 [2025-03-17 15:50:04,369 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 497 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:04,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1199 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:50:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-17 15:50:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 377. [2025-03-17 15:50:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 269 states have (on average 1.5724907063197027) internal successors, (423), 363 states have internal predecessors, (423), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-17 15:50:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 443 transitions. [2025-03-17 15:50:04,377 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 443 transitions. Word has length 73 [2025-03-17 15:50:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:04,378 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 443 transitions. [2025-03-17 15:50:04,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:50:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 443 transitions. [2025-03-17 15:50:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 15:50:04,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:04,378 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:04,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 15:50:04,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:04,579 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting func_to_recursive_line_25_to_33_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:50:04,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1447520232, now seen corresponding path program 1 times [2025-03-17 15:50:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:04,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236200190] [2025-03-17 15:50:04,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:04,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:50:04,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:50:04,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:04,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:04,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317634782] [2025-03-17 15:50:04,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:04,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:04,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:04,599 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:04,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 15:50:04,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:50:04,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:50:04,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:04,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:04,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 15:50:04,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:04,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 15:50:04,817 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 25 treesize of output 13 [2025-03-17 15:50:04,857 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-03-17 15:50:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:04,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236200190] [2025-03-17 15:50:05,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317634782] [2025-03-17 15:50:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317634782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:50:05,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:50:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-17 15:50:05,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542228211] [2025-03-17 15:50:05,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:05,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 15:50:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:05,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 15:50:05,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:50:05,145 INFO L87 Difference]: Start difference. First operand 377 states and 443 transitions. Second operand has 17 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:50:07,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-17 15:50:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:08,490 INFO L93 Difference]: Finished difference Result 404 states and 451 transitions. [2025-03-17 15:50:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 15:50:08,491 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2025-03-17 15:50:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:08,492 INFO L225 Difference]: With dead ends: 404 [2025-03-17 15:50:08,492 INFO L226 Difference]: Without dead ends: 403 [2025-03-17 15:50:08,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2025-03-17 15:50:08,492 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 705 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:08,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1531 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 962 Invalid, 2 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 15:50:08,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-17 15:50:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 378. [2025-03-17 15:50:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 363 states have internal predecessors, (422), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 15:50:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 444 transitions. [2025-03-17 15:50:08,506 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 444 transitions. Word has length 74 [2025-03-17 15:50:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:08,506 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 444 transitions. [2025-03-17 15:50:08,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:50:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 444 transitions. [2025-03-17 15:50:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 15:50:08,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:08,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:08,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:08,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:08,711 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting func_to_recursive_line_25_to_33_0Err51ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:50:08,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:08,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1923454311, now seen corresponding path program 1 times [2025-03-17 15:50:08,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:08,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071712707] [2025-03-17 15:50:08,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:08,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:08,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 15:50:08,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 15:50:08,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:08,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546821580] [2025-03-17 15:50:08,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:08,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:08,730 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:08,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 15:50:08,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 15:50:08,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 15:50:08,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:08,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:08,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 15:50:08,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:08,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:50:08,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 15:50:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:08,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071712707] [2025-03-17 15:50:09,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546821580] [2025-03-17 15:50:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546821580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:09,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:50:09,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-17 15:50:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155991691] [2025-03-17 15:50:09,253 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:09,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:50:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:09,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:50:09,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:50:09,254 INFO L87 Difference]: Start difference. First operand 378 states and 444 transitions. Second operand has 12 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:50:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:09,720 INFO L93 Difference]: Finished difference Result 450 states and 457 transitions. [2025-03-17 15:50:09,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:50:09,721 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2025-03-17 15:50:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:09,722 INFO L225 Difference]: With dead ends: 450 [2025-03-17 15:50:09,722 INFO L226 Difference]: Without dead ends: 449 [2025-03-17 15:50:09,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2025-03-17 15:50:09,723 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 358 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:09,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1552 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:50:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-17 15:50:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 378. [2025-03-17 15:50:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 270 states have (on average 1.5592592592592593) internal successors, (421), 363 states have internal predecessors, (421), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 15:50:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 443 transitions. [2025-03-17 15:50:09,732 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 443 transitions. Word has length 75 [2025-03-17 15:50:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:09,732 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 443 transitions. [2025-03-17 15:50:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:50:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 443 transitions. [2025-03-17 15:50:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 15:50:09,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:09,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:09,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:09,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:09,934 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting func_to_recursive_line_25_to_33_0Err50ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:50:09,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash -502458426, now seen corresponding path program 1 times [2025-03-17 15:50:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432478800] [2025-03-17 15:50:09,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:09,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 15:50:09,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 15:50:09,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:09,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:09,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196058035] [2025-03-17 15:50:09,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:09,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:09,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:09,954 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:09,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 15:50:10,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 15:50:10,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 15:50:10,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:10,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:10,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 15:50:10,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:10,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 15:50:10,167 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 36 treesize of output 13 [2025-03-17 15:50:10,225 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 29 treesize of output 13 [2025-03-17 15:50:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:10,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:26,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432478800] [2025-03-17 15:50:26,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:26,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196058035] [2025-03-17 15:50:26,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196058035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:50:26,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:50:26,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2025-03-17 15:50:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665209499] [2025-03-17 15:50:26,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:26,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 15:50:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:26,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 15:50:26,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=305, Unknown=4, NotChecked=0, Total=380 [2025-03-17 15:50:26,638 INFO L87 Difference]: Start difference. First operand 378 states and 443 transitions. Second operand has 20 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:50:30,808 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 [1] [2025-03-17 15:50:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:32,305 INFO L93 Difference]: Finished difference Result 403 states and 448 transitions. [2025-03-17 15:50:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 15:50:32,305 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2025-03-17 15:50:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:32,306 INFO L225 Difference]: With dead ends: 403 [2025-03-17 15:50:32,306 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 15:50:32,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=224, Invalid=702, Unknown=4, NotChecked=0, Total=930 [2025-03-17 15:50:32,307 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 758 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:32,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 1491 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 944 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-03-17 15:50:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 15:50:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 377. [2025-03-17 15:50:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 270 states have (on average 1.5518518518518518) internal successors, (419), 362 states have internal predecessors, (419), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 15:50:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 441 transitions. [2025-03-17 15:50:32,316 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 441 transitions. Word has length 76 [2025-03-17 15:50:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:32,317 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 441 transitions. [2025-03-17 15:50:32,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:50:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 441 transitions. [2025-03-17 15:50:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 15:50:32,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:32,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:32,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:32,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:32,520 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting func_to_recursive_line_25_to_33_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:50:32,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1603658053, now seen corresponding path program 1 times [2025-03-17 15:50:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:32,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564064553] [2025-03-17 15:50:32,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:32,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 15:50:32,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 15:50:32,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:32,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:32,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424676219] [2025-03-17 15:50:32,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:32,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:32,539 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:32,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 15:50:32,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 15:50:32,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 15:50:32,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:32,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:32,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 15:50:32,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:32,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:50:32,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 15:50:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:32,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:33,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564064553] [2025-03-17 15:50:33,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424676219] [2025-03-17 15:50:33,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424676219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:33,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:50:33,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-17 15:50:33,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791522089] [2025-03-17 15:50:33,211 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:33,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 15:50:33,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:33,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 15:50:33,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:50:33,211 INFO L87 Difference]: Start difference. First operand 377 states and 441 transitions. Second operand has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:50:33,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:33,702 INFO L93 Difference]: Finished difference Result 447 states and 454 transitions. [2025-03-17 15:50:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:50:33,702 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2025-03-17 15:50:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:33,703 INFO L225 Difference]: With dead ends: 447 [2025-03-17 15:50:33,703 INFO L226 Difference]: Without dead ends: 446 [2025-03-17 15:50:33,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2025-03-17 15:50:33,704 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 477 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:33,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1273 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:50:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-17 15:50:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 377. [2025-03-17 15:50:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 270 states have (on average 1.548148148148148) internal successors, (418), 362 states have internal predecessors, (418), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 15:50:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 440 transitions. [2025-03-17 15:50:33,721 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 440 transitions. Word has length 77 [2025-03-17 15:50:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:33,721 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 440 transitions. [2025-03-17 15:50:33,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:50:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 440 transitions. [2025-03-17 15:50:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 15:50:33,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:33,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:33,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:33,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-17 15:50:33,926 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting func_to_recursive_line_25_to_33_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-03-17 15:50:33,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1826207836, now seen corresponding path program 1 times [2025-03-17 15:50:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411514183] [2025-03-17 15:50:33,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:33,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 15:50:33,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 15:50:33,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:33,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083793806] [2025-03-17 15:50:33,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:33,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:33,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:33,952 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:33,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 15:50:34,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 15:50:34,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 15:50:34,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:34,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:34,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 15:50:34,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:34,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 15:50:34,170 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 36 treesize of output 13 [2025-03-17 15:50:34,242 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 36 treesize of output 16 [2025-03-17 15:50:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:50:34,259 INFO L312 TraceCheckSpWp]: Computing backward predicates...