./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:03:15,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:03:15,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:03:15,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:03:15,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:03:15,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:03:15,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:03:15,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:03:15,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:03:15,186 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:03:15,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:03:15,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:03:15,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:03:15,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:03:15,187 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:03:15,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:03:15,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:03:15,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:03:15,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:03:15,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e [2025-02-08 10:03:15,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:03:15,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:03:15,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:03:15,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:03:15,449 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:03:15,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2025-02-08 10:03:16,696 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9913b8dc1/06c0505c3fc844019e588c86076a822f/FLAG9245a8911 [2025-02-08 10:03:16,945 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:03:16,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2025-02-08 10:03:16,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9913b8dc1/06c0505c3fc844019e588c86076a822f/FLAG9245a8911 [2025-02-08 10:03:17,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9913b8dc1/06c0505c3fc844019e588c86076a822f [2025-02-08 10:03:17,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:03:17,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:03:17,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:03:17,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:03:17,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:03:17,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17, skipping insertion in model container [2025-02-08 10:03:17,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:03:17,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:03:17,444 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:03:17,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:03:17,480 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:03:17,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17 WrapperNode [2025-02-08 10:03:17,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:03:17,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:03:17,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:03:17,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:03:17,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,521 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2025-02-08 10:03:17,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:03:17,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:03:17,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:03:17,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:03:17,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,555 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 5, 11, 21, 15, 12]. 32 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 1, 2, 2, 2, 2]. [2025-02-08 10:03:17,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:03:17,574 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:03:17,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:03:17,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:03:17,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (1/1) ... [2025-02-08 10:03:17,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:03:17,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:17,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 10:03:17,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 10:03:17,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:03:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:03:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:03:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:03:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:03:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:03:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 10:03:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:03:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:03:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:03:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:03:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:03:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:03:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 10:03:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_39_0 [2025-02-08 10:03:17,634 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_39_0 [2025-02-08 10:03:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:03:17,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:03:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:03:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:03:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:03:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:03:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:03:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 10:03:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:03:17,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:03:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:03:17,731 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:03:17,732 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:03:18,418 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: 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_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#z~0#1.base, main_~#z~0#1.offset);havoc main_~#z~0#1.base, main_~#z~0#1.offset; [2025-02-08 10:03:18,455 INFO L? ?]: Removed 356 outVars from TransFormulas that were not future-live. [2025-02-08 10:03:18,456 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:03:18,473 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:03:18,473 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:03:18,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:03:18 BoogieIcfgContainer [2025-02-08 10:03:18,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:03:18,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:03:18,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:03:18,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:03:18,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:03:17" (1/3) ... [2025-02-08 10:03:18,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6114319a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:03:18, skipping insertion in model container [2025-02-08 10:03:18,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:17" (2/3) ... [2025-02-08 10:03:18,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6114319a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:03:18, skipping insertion in model container [2025-02-08 10:03:18,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:03:18" (3/3) ... [2025-02-08 10:03:18,485 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_cohencu.c [2025-02-08 10:03:18,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:03:18,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_cohencu.c that has 3 procedures, 314 locations, 1 initial locations, 0 loop locations, and 138 error locations. [2025-02-08 10:03:18,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:03:18,557 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;@70e86386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:03:18,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-02-08 10:03:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 314 states, 160 states have (on average 1.88125) internal successors, (301), 299 states have internal predecessors, (301), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 10:03:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 10:03:18,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:18,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 10:03:18,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash 327080285, now seen corresponding path program 1 times [2025-02-08 10:03:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:18,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006436689] [2025-02-08 10:03:18,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:18,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 10:03:18,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 10:03:18,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:18,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:19,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:19,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006436689] [2025-02-08 10:03:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006436689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:19,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:19,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:03:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145184371] [2025-02-08 10:03:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:19,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:19,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:19,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:19,056 INFO L87 Difference]: Start difference. First operand has 314 states, 160 states have (on average 1.88125) internal successors, (301), 299 states have internal predecessors, (301), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:03:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:19,277 INFO L93 Difference]: Finished difference Result 734 states and 788 transitions. [2025-02-08 10:03:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 10:03:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:19,290 INFO L225 Difference]: With dead ends: 734 [2025-02-08 10:03:19,290 INFO L226 Difference]: Without dead ends: 417 [2025-02-08 10:03:19,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:19,297 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 205 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:19,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1520 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-08 10:03:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 370. [2025-02-08 10:03:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8537735849056605) internal successors, (393), 350 states have internal predecessors, (393), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-08 10:03:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 428 transitions. [2025-02-08 10:03:19,369 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 428 transitions. Word has length 5 [2025-02-08 10:03:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:19,371 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 428 transitions. [2025-02-08 10:03:19,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:03:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 428 transitions. [2025-02-08 10:03:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 10:03:19,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:19,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:19,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:03:19,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_27_to_39_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:19,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:19,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1687648903, now seen corresponding path program 1 times [2025-02-08 10:03:19,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:19,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-02-08 10:03:19,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:19,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:19,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 10:03:19,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 10:03:19,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:19,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:19,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:19,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962912834] [2025-02-08 10:03:19,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962912834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:19,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:19,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286084726] [2025-02-08 10:03:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:19,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:19,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:19,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:19,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:19,619 INFO L87 Difference]: Start difference. First operand 370 states and 428 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:03:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:19,827 INFO L93 Difference]: Finished difference Result 417 states and 433 transitions. [2025-02-08 10:03:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:19,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 10:03:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:19,829 INFO L225 Difference]: With dead ends: 417 [2025-02-08 10:03:19,830 INFO L226 Difference]: Without dead ends: 413 [2025-02-08 10:03:19,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:19,831 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 200 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:19,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1474 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:03:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-08 10:03:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 370. [2025-02-08 10:03:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8349056603773586) internal successors, (389), 350 states have internal predecessors, (389), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-08 10:03:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 424 transitions. [2025-02-08 10:03:19,846 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 424 transitions. Word has length 15 [2025-02-08 10:03:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:19,846 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 424 transitions. [2025-02-08 10:03:19,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:03:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 424 transitions. [2025-02-08 10:03:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 10:03:19,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:19,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:19,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:03:19,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_39_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:19,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 7091381, now seen corresponding path program 1 times [2025-02-08 10:03:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:19,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304941679] [2025-02-08 10:03:19,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:19,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 10:03:19,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 10:03:19,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:19,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:19,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:19,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304941679] [2025-02-08 10:03:19,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304941679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:19,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:19,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802546258] [2025-02-08 10:03:19,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:19,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:19,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:19,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:19,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:19,998 INFO L87 Difference]: Start difference. First operand 370 states and 424 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:03:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:20,169 INFO L93 Difference]: Finished difference Result 413 states and 429 transitions. [2025-02-08 10:03:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-02-08 10:03:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:20,172 INFO L225 Difference]: With dead ends: 413 [2025-02-08 10:03:20,172 INFO L226 Difference]: Without dead ends: 411 [2025-02-08 10:03:20,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:20,173 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 186 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:20,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1476 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-08 10:03:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 370. [2025-02-08 10:03:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8254716981132075) internal successors, (387), 350 states have internal predecessors, (387), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-08 10:03:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 422 transitions. [2025-02-08 10:03:20,195 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 422 transitions. Word has length 19 [2025-02-08 10:03:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:20,195 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 422 transitions. [2025-02-08 10:03:20,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:03:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 422 transitions. [2025-02-08 10:03:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 10:03:20,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:20,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:20,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 10:03:20,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:20,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1775115181, now seen corresponding path program 1 times [2025-02-08 10:03:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:20,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950756697] [2025-02-08 10:03:20,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:20,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 10:03:20,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 10:03:20,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:20,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:20,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:20,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950756697] [2025-02-08 10:03:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950756697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:20,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:20,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:03:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982245891] [2025-02-08 10:03:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:20,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:03:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:20,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:03:20,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:03:20,363 INFO L87 Difference]: Start difference. First operand 370 states and 422 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:03:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:20,548 INFO L93 Difference]: Finished difference Result 411 states and 427 transitions. [2025-02-08 10:03:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:03:20,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 21 [2025-02-08 10:03:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:20,552 INFO L225 Difference]: With dead ends: 411 [2025-02-08 10:03:20,552 INFO L226 Difference]: Without dead ends: 409 [2025-02-08 10:03:20,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:03:20,553 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 188 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:20,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1544 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-02-08 10:03:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 370. [2025-02-08 10:03:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8160377358490567) internal successors, (385), 350 states have internal predecessors, (385), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-08 10:03:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 420 transitions. [2025-02-08 10:03:20,565 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 420 transitions. Word has length 21 [2025-02-08 10:03:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:20,565 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 420 transitions. [2025-02-08 10:03:20,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:03:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 420 transitions. [2025-02-08 10:03:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 10:03:20,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:20,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 10:03:20,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:20,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash 806004304, now seen corresponding path program 1 times [2025-02-08 10:03:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-02-08 10:03:20,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:20,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 10:03:20,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 10:03:20,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:20,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-02-08 10:03:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873290175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:20,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:20,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:20,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836217054] [2025-02-08 10:03:20,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:20,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:20,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:20,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:20,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:20,727 INFO L87 Difference]: Start difference. First operand 370 states and 420 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:03:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:20,873 INFO L93 Difference]: Finished difference Result 409 states and 425 transitions. [2025-02-08 10:03:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:20,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 22 [2025-02-08 10:03:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:20,875 INFO L225 Difference]: With dead ends: 409 [2025-02-08 10:03:20,875 INFO L226 Difference]: Without dead ends: 407 [2025-02-08 10:03:20,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:20,876 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 175 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:20,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1478 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-08 10:03:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 370. [2025-02-08 10:03:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 212 states have (on average 1.8066037735849056) internal successors, (383), 350 states have internal predecessors, (383), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-08 10:03:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 418 transitions. [2025-02-08 10:03:20,884 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 418 transitions. Word has length 22 [2025-02-08 10:03:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:20,884 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 418 transitions. [2025-02-08 10:03:20,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:03:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 418 transitions. [2025-02-08 10:03:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 10:03:20,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:20,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:20,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 10:03:20,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_39_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:20,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1983695295, now seen corresponding path program 1 times [2025-02-08 10:03:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:20,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-02-08 10:03:20,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:20,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 10:03:20,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 10:03:20,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:20,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:03:20,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288720222] [2025-02-08 10:03:20,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:20,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:20,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:20,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:03:20,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 10:03:20,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 10:03:20,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 10:03:20,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:20,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:21,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 10:03:21,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:21,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:03:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:03:21,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:03:21,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:21,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237134654] [2025-02-08 10:03:21,195 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:03:21,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288720222] [2025-02-08 10:03:21,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288720222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:21,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:21,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470142105] [2025-02-08 10:03:21,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:21,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:03:21,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:21,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:03:21,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:03:21,196 INFO L87 Difference]: Start difference. First operand 370 states and 418 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:03:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:21,352 INFO L93 Difference]: Finished difference Result 589 states and 608 transitions. [2025-02-08 10:03:21,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:03:21,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-02-08 10:03:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:21,354 INFO L225 Difference]: With dead ends: 589 [2025-02-08 10:03:21,354 INFO L226 Difference]: Without dead ends: 585 [2025-02-08 10:03:21,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:03:21,355 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 417 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:21,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1501 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-08 10:03:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 452. [2025-02-08 10:03:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.8159722222222223) internal successors, (523), 426 states have internal predecessors, (523), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 568 transitions. [2025-02-08 10:03:21,373 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 568 transitions. Word has length 31 [2025-02-08 10:03:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:21,373 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 568 transitions. [2025-02-08 10:03:21,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:03:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 568 transitions. [2025-02-08 10:03:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 10:03:21,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:21,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:21,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 10:03:21,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:21,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:21,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash -148998795, now seen corresponding path program 1 times [2025-02-08 10:03:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:21,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516308374] [2025-02-08 10:03:21,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:21,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 10:03:21,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 10:03:21,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:21,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:03:21,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625505099] [2025-02-08 10:03:21,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:21,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:21,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:21,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:03:21,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 10:03:21,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 10:03:21,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 10:03:21,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:21,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:21,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 10:03:21,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:21,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:03:21,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:03:21,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 10:03:22,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 10:03:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:03:22,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:03:22,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516308374] [2025-02-08 10:03:22,384 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:03:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625505099] [2025-02-08 10:03:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625505099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:22,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:03:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-08 10:03:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209935489] [2025-02-08 10:03:22,385 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 10:03:22,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 10:03:22,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:22,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 10:03:22,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-08 10:03:22,386 INFO L87 Difference]: Start difference. First operand 452 states and 568 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:03:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:23,375 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2025-02-08 10:03:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 10:03:23,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-02-08 10:03:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:23,382 INFO L225 Difference]: With dead ends: 593 [2025-02-08 10:03:23,382 INFO L226 Difference]: Without dead ends: 592 [2025-02-08 10:03:23,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-02-08 10:03:23,383 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 630 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:23,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 2281 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 10:03:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-08 10:03:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 452. [2025-02-08 10:03:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.8125) internal successors, (522), 426 states have internal predecessors, (522), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 567 transitions. [2025-02-08 10:03:23,416 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 567 transitions. Word has length 41 [2025-02-08 10:03:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 567 transitions. [2025-02-08 10:03:23,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:03:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 567 transitions. [2025-02-08 10:03:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 10:03:23,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:23,418 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:23,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 10:03:23,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:23,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -323995302, now seen corresponding path program 1 times [2025-02-08 10:03:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:23,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980183451] [2025-02-08 10:03:23,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:23,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 10:03:23,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 10:03:23,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:23,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:03:23,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788055473] [2025-02-08 10:03:23,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:23,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:23,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:23,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:03:23,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 10:03:23,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 10:03:23,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 10:03:23,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:23,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:23,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 10:03:23,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:23,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:03:23,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:03:23,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 10:03:24,394 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 35 treesize of output 19 [2025-02-08 10:03:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:03:24,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:03:24,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:24,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980183451] [2025-02-08 10:03:24,589 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:03:24,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788055473] [2025-02-08 10:03:24,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788055473] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:24,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:03:24,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-02-08 10:03:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033140337] [2025-02-08 10:03:24,589 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 10:03:24,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 10:03:24,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:24,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 10:03:24,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-08 10:03:24,590 INFO L87 Difference]: Start difference. First operand 452 states and 567 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:03:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:25,598 INFO L93 Difference]: Finished difference Result 592 states and 611 transitions. [2025-02-08 10:03:25,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 10:03:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-02-08 10:03:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:25,601 INFO L225 Difference]: With dead ends: 592 [2025-02-08 10:03:25,601 INFO L226 Difference]: Without dead ends: 591 [2025-02-08 10:03:25,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-02-08 10:03:25,602 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 516 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2963 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:25,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2963 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 10:03:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-02-08 10:03:25,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 452. [2025-02-08 10:03:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.8090277777777777) internal successors, (521), 426 states have internal predecessors, (521), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 566 transitions. [2025-02-08 10:03:25,621 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 566 transitions. Word has length 42 [2025-02-08 10:03:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:25,622 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 566 transitions. [2025-02-08 10:03:25,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:03:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 566 transitions. [2025-02-08 10:03:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 10:03:25,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:25,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:25,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 10:03:25,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:25,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_27_to_39_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:25,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:25,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1453919725, now seen corresponding path program 1 times [2025-02-08 10:03:25,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:25,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533685110] [2025-02-08 10:03:25,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:25,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:25,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 10:03:25,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 10:03:25,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:25,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:03:26,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:26,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533685110] [2025-02-08 10:03:26,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533685110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:26,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:26,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197086812] [2025-02-08 10:03:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:26,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:26,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:26,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:26,021 INFO L87 Difference]: Start difference. First operand 452 states and 566 transitions. Second operand has 6 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:26,189 INFO L93 Difference]: Finished difference Result 559 states and 579 transitions. [2025-02-08 10:03:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-02-08 10:03:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:26,192 INFO L225 Difference]: With dead ends: 559 [2025-02-08 10:03:26,192 INFO L226 Difference]: Without dead ends: 557 [2025-02-08 10:03:26,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:26,194 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 313 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:26,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1426 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-08 10:03:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 452. [2025-02-08 10:03:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.8020833333333333) internal successors, (519), 426 states have internal predecessors, (519), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 564 transitions. [2025-02-08 10:03:26,211 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 564 transitions. Word has length 43 [2025-02-08 10:03:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:26,211 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 564 transitions. [2025-02-08 10:03:26,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 564 transitions. [2025-02-08 10:03:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 10:03:26,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:26,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:26,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 10:03:26,214 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:26,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1352483151, now seen corresponding path program 1 times [2025-02-08 10:03:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982296754] [2025-02-08 10:03:26,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:26,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 10:03:26,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 10:03:26,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:26,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:03:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982296754] [2025-02-08 10:03:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982296754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:26,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:26,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:03:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478431604] [2025-02-08 10:03:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:26,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:03:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:26,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:03:26,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:03:26,342 INFO L87 Difference]: Start difference. First operand 452 states and 564 transitions. Second operand has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:26,562 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2025-02-08 10:03:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:03:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-02-08 10:03:26,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:26,564 INFO L225 Difference]: With dead ends: 557 [2025-02-08 10:03:26,564 INFO L226 Difference]: Without dead ends: 556 [2025-02-08 10:03:26,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:03:26,565 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 309 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:26,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1689 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:03:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-02-08 10:03:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 452. [2025-02-08 10:03:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7986111111111112) internal successors, (518), 426 states have internal predecessors, (518), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 563 transitions. [2025-02-08 10:03:26,579 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 563 transitions. Word has length 45 [2025-02-08 10:03:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:26,579 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 563 transitions. [2025-02-08 10:03:26,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 563 transitions. [2025-02-08 10:03:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 10:03:26,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:26,580 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:26,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 10:03:26,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:26,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1022695318, now seen corresponding path program 1 times [2025-02-08 10:03:26,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:26,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553655341] [2025-02-08 10:03:26,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:26,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 10:03:26,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 10:03:26,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:03:26,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:26,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553655341] [2025-02-08 10:03:26,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553655341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:26,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:26,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:26,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238562634] [2025-02-08 10:03:26,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:26,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:26,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:26,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:26,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:26,726 INFO L87 Difference]: Start difference. First operand 452 states and 563 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:26,939 INFO L93 Difference]: Finished difference Result 556 states and 576 transitions. [2025-02-08 10:03:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-02-08 10:03:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:26,941 INFO L225 Difference]: With dead ends: 556 [2025-02-08 10:03:26,941 INFO L226 Difference]: Without dead ends: 555 [2025-02-08 10:03:26,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:26,941 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 306 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:26,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1426 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:03:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-02-08 10:03:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 452. [2025-02-08 10:03:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7951388888888888) internal successors, (517), 426 states have internal predecessors, (517), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 562 transitions. [2025-02-08 10:03:26,954 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 562 transitions. Word has length 46 [2025-02-08 10:03:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:26,954 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 562 transitions. [2025-02-08 10:03:26,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 562 transitions. [2025-02-08 10:03:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 10:03:26,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:26,955 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 10:03:26,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_27_to_39_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:26,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1638783823, now seen corresponding path program 1 times [2025-02-08 10:03:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358619012] [2025-02-08 10:03:26,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:26,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:26,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 10:03:26,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 10:03:26,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:26,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:03:27,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:27,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358619012] [2025-02-08 10:03:27,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358619012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:27,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:27,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:27,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428280989] [2025-02-08 10:03:27,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:27,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:27,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:27,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:27,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:27,067 INFO L87 Difference]: Start difference. First operand 452 states and 562 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:27,226 INFO L93 Difference]: Finished difference Result 567 states and 587 transitions. [2025-02-08 10:03:27,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:27,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-02-08 10:03:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:27,228 INFO L225 Difference]: With dead ends: 567 [2025-02-08 10:03:27,228 INFO L226 Difference]: Without dead ends: 565 [2025-02-08 10:03:27,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:27,228 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 311 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:27,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1418 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-02-08 10:03:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 452. [2025-02-08 10:03:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7881944444444444) internal successors, (515), 426 states have internal predecessors, (515), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 560 transitions. [2025-02-08 10:03:27,245 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 560 transitions. Word has length 47 [2025-02-08 10:03:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:27,245 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 560 transitions. [2025-02-08 10:03:27,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 560 transitions. [2025-02-08 10:03:27,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 10:03:27,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:27,246 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:27,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:03:27,246 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:27,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1381742611, now seen corresponding path program 1 times [2025-02-08 10:03:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:27,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156381793] [2025-02-08 10:03:27,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:27,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 10:03:27,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 10:03:27,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:27,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:03:27,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339903538] [2025-02-08 10:03:27,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:27,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:27,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:27,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:03:27,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 10:03:27,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 10:03:27,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 10:03:27,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:27,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:27,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-08 10:03:27,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:27,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:03:27,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:03:27,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:03:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 10:03:27,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:03:27,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:27,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156381793] [2025-02-08 10:03:27,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:03:27,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339903538] [2025-02-08 10:03:27,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339903538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:27,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:27,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 10:03:27,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563824625] [2025-02-08 10:03:27,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:27,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 10:03:27,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:27,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 10:03:27,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:03:27,793 INFO L87 Difference]: Start difference. First operand 452 states and 560 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:03:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:28,435 INFO L93 Difference]: Finished difference Result 581 states and 600 transitions. [2025-02-08 10:03:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 10:03:28,436 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-02-08 10:03:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:28,437 INFO L225 Difference]: With dead ends: 581 [2025-02-08 10:03:28,437 INFO L226 Difference]: Without dead ends: 580 [2025-02-08 10:03:28,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-02-08 10:03:28,438 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 500 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:28,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2463 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 10:03:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-08 10:03:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 452. [2025-02-08 10:03:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7847222222222223) internal successors, (514), 426 states have internal predecessors, (514), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 559 transitions. [2025-02-08 10:03:28,457 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 559 transitions. Word has length 49 [2025-02-08 10:03:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:28,457 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 559 transitions. [2025-02-08 10:03:28,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:03:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 559 transitions. [2025-02-08 10:03:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 10:03:28,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:28,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:28,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 10:03:28,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 10:03:28,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash 115652050, now seen corresponding path program 1 times [2025-02-08 10:03:28,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:28,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667209179] [2025-02-08 10:03:28,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:28,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:28,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 10:03:28,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 10:03:28,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:28,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:03:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667209179] [2025-02-08 10:03:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667209179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:28,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:28,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:28,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630988116] [2025-02-08 10:03:28,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:28,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:28,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:28,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:28,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:28,782 INFO L87 Difference]: Start difference. First operand 452 states and 559 transitions. Second operand has 6 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:28,953 INFO L93 Difference]: Finished difference Result 564 states and 584 transitions. [2025-02-08 10:03:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-02-08 10:03:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:28,955 INFO L225 Difference]: With dead ends: 564 [2025-02-08 10:03:28,955 INFO L226 Difference]: Without dead ends: 563 [2025-02-08 10:03:28,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:28,955 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 304 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:28,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1411 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-08 10:03:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 452. [2025-02-08 10:03:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.78125) internal successors, (513), 426 states have internal predecessors, (513), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 558 transitions. [2025-02-08 10:03:28,967 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 558 transitions. Word has length 50 [2025-02-08 10:03:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:28,968 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 558 transitions. [2025-02-08 10:03:28,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 558 transitions. [2025-02-08 10:03:28,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 10:03:28,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:28,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:28,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 10:03:28,968 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_27_to_39_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:28,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash -709753717, now seen corresponding path program 1 times [2025-02-08 10:03:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:28,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889803585] [2025-02-08 10:03:28,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:28,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 10:03:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 10:03:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:03:29,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:29,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889803585] [2025-02-08 10:03:29,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889803585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:29,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:29,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:29,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644687839] [2025-02-08 10:03:29,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:29,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:29,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:29,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:29,090 INFO L87 Difference]: Start difference. First operand 452 states and 558 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:29,244 INFO L93 Difference]: Finished difference Result 575 states and 595 transitions. [2025-02-08 10:03:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-02-08 10:03:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:29,246 INFO L225 Difference]: With dead ends: 575 [2025-02-08 10:03:29,246 INFO L226 Difference]: Without dead ends: 573 [2025-02-08 10:03:29,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:29,247 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 309 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:29,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1411 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-08 10:03:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 452. [2025-02-08 10:03:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 288 states have (on average 1.7743055555555556) internal successors, (511), 426 states have internal predecessors, (511), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-08 10:03:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 556 transitions. [2025-02-08 10:03:29,263 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 556 transitions. Word has length 51 [2025-02-08 10:03:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:29,263 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 556 transitions. [2025-02-08 10:03:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:03:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 556 transitions. [2025-02-08 10:03:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 10:03:29,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:29,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:29,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 10:03:29,264 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-08 10:03:29,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash 826478889, now seen corresponding path program 1 times [2025-02-08 10:03:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655082755] [2025-02-08 10:03:29,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:29,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 10:03:29,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 10:03:29,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:29,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat