./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.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_loop-simple/recursified_nested_3.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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:47:26,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:47:26,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:47:26,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:47:26,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:47:26,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:47:26,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:47:26,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:47:26,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:47:26,397 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:47:26,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:47:26,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:47:26,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:47:26,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:47:26,398 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:47:26,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:47:26,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:47:26,400 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:47:26,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:47:26,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:47:26,400 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2025-03-17 15:47:26,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:47:26,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:47:26,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:47:26,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:47:26,616 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:47:26,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-03-17 15:47:27,761 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5403b77f6/d7e7470d2aff47b18d33e365450f52e5/FLAGf85ef7fcb [2025-03-17 15:47:27,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:47:27,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-03-17 15:47:27,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5403b77f6/d7e7470d2aff47b18d33e365450f52e5/FLAGf85ef7fcb [2025-03-17 15:47:28,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5403b77f6/d7e7470d2aff47b18d33e365450f52e5 [2025-03-17 15:47:28,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:47:28,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:47:28,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:47:28,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:47:28,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:47:28,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcceb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28, skipping insertion in model container [2025-03-17 15:47:28,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:47:28,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:47:28,439 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:47:28,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:47:28,461 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:47:28,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28 WrapperNode [2025-03-17 15:47:28,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:47:28,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:47:28,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:47:28,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:47:28,466 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:47:28" (1/1) ... [2025-03-17 15:47:28,470 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:47:28" (1/1) ... [2025-03-17 15:47:28,479 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2025-03-17 15:47:28,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:47:28,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:47:28,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:47:28,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:47:28,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,497 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2]. [2025-03-17 15:47:28,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:47:28,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:47:28,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:47:28,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:47:28,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:47:28,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:28,531 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:47:28,533 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:47:28,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:47:28,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:47:28,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:47:28,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 15:47:28,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 15:47:28,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 15:47:28,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 15:47:28,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 15:47:28,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 15:47:28,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 15:47:28,550 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2025-03-17 15:47:28,550 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2025-03-17 15:47:28,550 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-03-17 15:47:28,550 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-03-17 15:47:28,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:47:28,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:47:28,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 15:47:28,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 15:47:28,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 15:47:28,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 15:47:28,550 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2025-03-17 15:47:28,550 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2025-03-17 15:47:28,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 15:47:28,619 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:47:28,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:47:28,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-17 15:47:28,749 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-17 15:47:28,749 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:47:28,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:47:28,758 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:47:28,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:47:28 BoogieIcfgContainer [2025-03-17 15:47:28,759 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:47:28,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:47:28,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:47:28,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:47:28,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:47:28" (1/3) ... [2025-03-17 15:47:28,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4f086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:47:28, skipping insertion in model container [2025-03-17 15:47:28,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (2/3) ... [2025-03-17 15:47:28,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4f086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:47:28, skipping insertion in model container [2025-03-17 15:47:28,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:47:28" (3/3) ... [2025-03-17 15:47:28,765 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2025-03-17 15:47:28,774 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:47:28,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_3.c that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-17 15:47:28,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:47:28,820 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;@373c3610, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:47:28,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 15:47:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:47:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 15:47:28,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:28,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:28,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:28,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash 282630712, now seen corresponding path program 1 times [2025-03-17 15:47:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:28,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480959900] [2025-03-17 15:47:28,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:28,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:28,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 15:47:28,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 15:47:28,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:28,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:29,202 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:47:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480959900] [2025-03-17 15:47:29,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480959900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:29,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:29,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:47:29,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109058094] [2025-03-17 15:47:29,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:29,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:29,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:29,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:29,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:29,224 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:29,332 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2025-03-17 15:47:29,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:29,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 15:47:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:29,338 INFO L225 Difference]: With dead ends: 60 [2025-03-17 15:47:29,339 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 15:47:29,340 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:47:29,342 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:29,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 202 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:47:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 15:47:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2025-03-17 15:47:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 15:47:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-17 15:47:29,377 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 11 [2025-03-17 15:47:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:29,377 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-17 15:47:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-17 15:47:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 15:47:29,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:29,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:29,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:47:29,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:29,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash 282679882, now seen corresponding path program 1 times [2025-03-17 15:47:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:29,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829927988] [2025-03-17 15:47:29,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:29,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 15:47:29,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 15:47:29,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:29,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:29,524 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:47:29,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:29,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829927988] [2025-03-17 15:47:29,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829927988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:29,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:29,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:47:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564511502] [2025-03-17 15:47:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:29,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:29,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:29,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:29,528 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:47:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:29,576 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-17 15:47:29,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:29,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 11 [2025-03-17 15:47:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:29,576 INFO L225 Difference]: With dead ends: 45 [2025-03-17 15:47:29,576 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 15:47:29,577 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:47:29,577 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:29,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 144 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 15:47:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 15:47:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:47:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-17 15:47:29,581 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 11 [2025-03-17 15:47:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:29,582 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-17 15:47:29,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:47:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-17 15:47:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:47:29,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:29,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:29,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:47:29,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:29,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1716733175, now seen corresponding path program 1 times [2025-03-17 15:47:29,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:29,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438442859] [2025-03-17 15:47:29,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:29,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:47:29,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:47:29,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:29,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:29,723 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:47:29,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:29,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438442859] [2025-03-17 15:47:29,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438442859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:29,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:29,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:47:29,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263752585] [2025-03-17 15:47:29,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:29,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:29,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:29,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:29,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:29,726 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:47:29,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:29,803 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2025-03-17 15:47:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-17 15:47:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:29,804 INFO L225 Difference]: With dead ends: 94 [2025-03-17 15:47:29,804 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 15:47:29,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:47:29,805 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:29,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:47:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 15:47:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2025-03-17 15:47:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:47:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-17 15:47:29,815 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 14 [2025-03-17 15:47:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:29,815 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-17 15:47:29,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:47:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-17 15:47:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 15:47:29,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:29,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:29,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:47:29,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:29,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash -562738270, now seen corresponding path program 1 times [2025-03-17 15:47:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:29,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397671360] [2025-03-17 15:47:29,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:29,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:29,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:47:29,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:47:29,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:29,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,066 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:47:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397671360] [2025-03-17 15:47:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397671360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127609361] [2025-03-17 15:47:30,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:30,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:30,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:30,070 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:47:30,072 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:47:30,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:47:30,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:47:30,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:30,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 15:47:30,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:30,168 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:47:30,220 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 23 treesize of output 3 [2025-03-17 15:47:30,255 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:47:30,272 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:47:30,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:30,354 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:47:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127609361] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:30,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:47:30,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 8] total 17 [2025-03-17 15:47:30,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307079712] [2025-03-17 15:47:30,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:30,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:30,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:30,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:47:30,355 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:30,418 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-03-17 15:47:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:47:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 15:47:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:30,420 INFO L225 Difference]: With dead ends: 46 [2025-03-17 15:47:30,420 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 15:47:30,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-17 15:47:30,420 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:30,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 15:47:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2025-03-17 15:47:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:47:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-17 15:47:30,427 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 16 [2025-03-17 15:47:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:30,427 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-17 15:47:30,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-17 15:47:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 15:47:30,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:30,427 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:30,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:47:30,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:30,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:30,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash -265017215, now seen corresponding path program 1 times [2025-03-17 15:47:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:30,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138221402] [2025-03-17 15:47:30,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:30,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:47:30,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:47:30,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:30,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:47:30,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138221402] [2025-03-17 15:47:30,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138221402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:30,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:30,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:47:30,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602791729] [2025-03-17 15:47:30,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:30,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:47:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:30,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:47:30,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:47:30,680 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:30,694 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-03-17 15:47:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:47:30,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 15:47:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:30,696 INFO L225 Difference]: With dead ends: 42 [2025-03-17 15:47:30,696 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 15:47:30,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:47:30,696 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:30,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 15:47:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-17 15:47:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.24) internal successors, (31), 29 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:47:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-17 15:47:30,703 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 17 [2025-03-17 15:47:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:30,703 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-17 15:47:30,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-17 15:47:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 15:47:30,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:30,703 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] [2025-03-17 15:47:30,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:47:30,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:30,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash 536144941, now seen corresponding path program 1 times [2025-03-17 15:47:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:30,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397218939] [2025-03-17 15:47:30,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:30,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 15:47:30,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 15:47:30,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:30,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:47:30,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:30,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397218939] [2025-03-17 15:47:30,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397218939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:30,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:30,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:47:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531617901] [2025-03-17 15:47:30,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:30,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:30,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:30,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:30,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:30,884 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:47:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:30,955 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2025-03-17 15:47:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2025-03-17 15:47:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:30,956 INFO L225 Difference]: With dead ends: 75 [2025-03-17 15:47:30,956 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 15:47:30,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:47:30,957 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:30,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 58 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:47:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 15:47:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 15:47:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-17 15:47:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-03-17 15:47:30,962 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 32 [2025-03-17 15:47:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:30,962 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-03-17 15:47:30,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:47:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-03-17 15:47:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 15:47:30,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:30,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:30,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:47:30,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:30,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:30,963 INFO L85 PathProgramCache]: Analyzing trace with hash 820444212, now seen corresponding path program 1 times [2025-03-17 15:47:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614184050] [2025-03-17 15:47:30,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:30,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 15:47:30,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 15:47:30,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:30,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:47:31,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:31,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614184050] [2025-03-17 15:47:31,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614184050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:31,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:31,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:47:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807702423] [2025-03-17 15:47:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:31,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:31,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:31,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:31,052 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:31,098 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-03-17 15:47:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:31,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-03-17 15:47:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:31,100 INFO L225 Difference]: With dead ends: 51 [2025-03-17 15:47:31,100 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 15:47:31,100 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:47:31,100 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:31,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 15:47:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 15:47:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:47:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-03-17 15:47:31,110 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 21 [2025-03-17 15:47:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:31,110 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-03-17 15:47:31,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-03-17 15:47:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 15:47:31,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:31,112 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:31,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:47:31,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:31,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1099400455, now seen corresponding path program 1 times [2025-03-17 15:47:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:31,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454026007] [2025-03-17 15:47:31,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:31,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:31,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:47:31,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:47:31,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:31,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:47:31,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:31,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454026007] [2025-03-17 15:47:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454026007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:31,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181469692] [2025-03-17 15:47:31,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:31,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:31,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:31,396 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:47:31,398 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:47:31,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:47:31,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:47:31,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:31,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:31,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 15:47:31,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:31,475 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:47:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:47:31,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:47:31,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181469692] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:31,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:31,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2025-03-17 15:47:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501256021] [2025-03-17 15:47:31,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:31,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 15:47:31,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:31,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 15:47:31,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-17 15:47:31,973 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 23 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 20 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-17 15:47:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:32,213 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2025-03-17 15:47:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:47:32,214 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 20 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 39 [2025-03-17 15:47:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:32,214 INFO L225 Difference]: With dead ends: 93 [2025-03-17 15:47:32,214 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 15:47:32,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:47:32,216 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:32,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 267 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:47:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 15:47:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 15:47:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-17 15:47:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-03-17 15:47:32,223 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 39 [2025-03-17 15:47:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:32,223 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-03-17 15:47:32,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 20 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-17 15:47:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-03-17 15:47:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 15:47:32,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:32,224 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:32,231 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:47:32,429 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,SelfDestructingSolverStorable7 [2025-03-17 15:47:32,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:32,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1819456867, now seen corresponding path program 2 times [2025-03-17 15:47:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:32,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942959011] [2025-03-17 15:47:32,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:47:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:32,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-17 15:47:32,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:47:32,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:47:32,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-17 15:47:32,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942959011] [2025-03-17 15:47:32,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942959011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850043077] [2025-03-17 15:47:32,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:47:32,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:32,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:32,729 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:47:32,731 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:47:32,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-17 15:47:32,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:47:32,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:47:32,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:32,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:47:32,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:32,836 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:47:32,983 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:47:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 15:47:32,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:47:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850043077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:32,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:47:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-03-17 15:47:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811632141] [2025-03-17 15:47:32,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:32,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:47:32,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:32,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:47:32,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:47:32,998 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:47:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:33,102 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-03-17 15:47:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:47:33,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 67 [2025-03-17 15:47:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:33,105 INFO L225 Difference]: With dead ends: 54 [2025-03-17 15:47:33,105 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 15:47:33,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:47:33,105 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:33,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 113 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:47:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 15:47:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-03-17 15:47:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-17 15:47:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-17 15:47:33,116 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 67 [2025-03-17 15:47:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:33,116 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-17 15:47:33,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:47:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-17 15:47:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 15:47:33,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:33,117 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:33,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:47:33,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:33,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:33,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:33,318 INFO L85 PathProgramCache]: Analyzing trace with hash 568588009, now seen corresponding path program 1 times [2025-03-17 15:47:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:33,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839534816] [2025-03-17 15:47:33,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:33,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:47:33,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:47:33,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:33,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-17 15:47:33,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839534816] [2025-03-17 15:47:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839534816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32782520] [2025-03-17 15:47:33,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:33,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:33,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:33,550 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:47:33,551 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:47:33,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:47:33,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:47:33,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:33,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:33,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:47:33,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:33,764 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:47:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-17 15:47:33,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:47:33,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32782520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:33,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:47:33,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-17 15:47:33,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942089647] [2025-03-17 15:47:33,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:33,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:33,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:33,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:33,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:47:33,777 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:47:37,824 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:47:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:37,831 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2025-03-17 15:47:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:47:37,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 68 [2025-03-17 15:47:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:37,832 INFO L225 Difference]: With dead ends: 50 [2025-03-17 15:47:37,833 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 15:47:37,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:47:37,833 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:37,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-17 15:47:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 15:47:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2025-03-17 15:47:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:47:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-17 15:47:37,843 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 68 [2025-03-17 15:47:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:37,843 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-17 15:47:37,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:47:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-17 15:47:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 15:47:37,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:37,844 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:37,851 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:47:38,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:38,045 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:38,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1397776989, now seen corresponding path program 1 times [2025-03-17 15:47:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975644939] [2025-03-17 15:47:38,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:38,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 15:47:38,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 15:47:38,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:38,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-17 15:47:38,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975644939] [2025-03-17 15:47:38,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975644939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671932130] [2025-03-17 15:47:38,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:38,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:38,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:38,355 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:47:38,357 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:47:38,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 15:47:38,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 15:47:38,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:38,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:38,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 15:47:38,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:38,476 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:47:38,632 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:47:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-17 15:47:38,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:47:38,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671932130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:38,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:47:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-03-17 15:47:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070756229] [2025-03-17 15:47:38,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:38,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:47:38,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:38,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:47:38,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:47:38,651 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:47:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:38,730 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-03-17 15:47:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:47:38,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 90 [2025-03-17 15:47:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:38,731 INFO L225 Difference]: With dead ends: 46 [2025-03-17 15:47:38,731 INFO L226 Difference]: Without dead ends: 45 [2025-03-17 15:47:38,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:47:38,731 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:38,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 86 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-17 15:47:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-17 15:47:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:47:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-17 15:47:38,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 90 [2025-03-17 15:47:38,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:38,740 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-17 15:47:38,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:47:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-17 15:47:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 15:47:38,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:38,742 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:47:38,749 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:47:38,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 15:47:38,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-17 15:47:38,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash -381413693, now seen corresponding path program 1 times [2025-03-17 15:47:38,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:38,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916780641] [2025-03-17 15:47:38,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:38,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:38,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 15:47:38,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 15:47:38,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:38,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-17 15:47:39,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:39,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916780641] [2025-03-17 15:47:39,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916780641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:39,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:39,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:47:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657349932] [2025-03-17 15:47:39,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:39,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:47:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:39,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:47:39,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:47:39,012 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:47:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:39,034 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-03-17 15:47:39,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:47:39,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-03-17 15:47:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:39,035 INFO L225 Difference]: With dead ends: 44 [2025-03-17 15:47:39,035 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:47:39,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:39,036 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:39,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:47:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:47:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:47:39,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2025-03-17 15:47:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:39,036 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:47:39,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:47:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:47:39,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:47:39,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 15:47:39,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 15:47:39,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 15:47:39,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 15:47:39,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 15:47:39,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 15:47:39,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:47:39,045 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:39,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:49:03,630 WARN L286 SmtUtils]: Spent 1.40m on a formula simplification. DAG size of input: 86 DAG size of output: 34 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)