./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2.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_ps2.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 179ef0051cd9d26bcc80fffb98e92972213fce9443d8e4c52f2d2f0c39f6f4cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:05:03,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:05:03,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:05:03,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:05:03,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:05:03,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:05:03,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:05:03,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:05:03,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:05:03,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:05:03,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:05:03,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:05:03,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:05:03,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:05:03,448 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:05:03,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:05:03,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:05:03,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:05:03,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:05:03,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:03,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:05:03,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:05:03,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:05:03,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:05:03,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:05:03,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:05:03,451 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 -> 179ef0051cd9d26bcc80fffb98e92972213fce9443d8e4c52f2d2f0c39f6f4cf [2025-02-08 10:05:03,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:05:03,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:05:03,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:05:03,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:05:03,662 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:05:03,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2.c [2025-02-08 10:05:04,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d40907e87/21994edb993a493e9983b526842ab1fa/FLAG947ec5caa [2025-02-08 10:05:05,036 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:05:05,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps2.c [2025-02-08 10:05:05,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d40907e87/21994edb993a493e9983b526842ab1fa/FLAG947ec5caa [2025-02-08 10:05:05,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d40907e87/21994edb993a493e9983b526842ab1fa [2025-02-08 10:05:05,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:05:05,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:05:05,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:05,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:05:05,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:05:05,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a144549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05, skipping insertion in model container [2025-02-08 10:05:05,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:05:05,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:05,225 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:05:05,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:05,256 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:05:05,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05 WrapperNode [2025-02-08 10:05:05,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:05,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:05,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:05:05,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:05:05,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,289 INFO L138 Inliner]: procedures = 16, calls = 51, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-02-08 10:05:05,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:05,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:05:05,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:05:05,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:05:05,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,315 INFO L175 MemorySlicer]: Split 29 memory accesses to 6 slices as follows [2, 2, 6, 5, 10, 4]. 34 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 0, 6, 0, 0, 0]. The 7 writes are split as follows [0, 1, 0, 2, 2, 2]. [2025-02-08 10:05:05,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:05:05,335 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:05:05,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:05:05,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:05:05,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (1/1) ... [2025-02-08 10:05:05,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:05,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:05,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 10:05:05,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 10:05:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:05:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_33_0 [2025-02-08 10:05:05,395 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_33_0 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:05:05,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:05:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:05:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:05:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:05:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:05:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:05:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 10:05:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:05:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:05:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:05:05,456 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:05:05,457 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:05:05,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#k~0#1.base, main_~#k~0#1.offset);havoc main_~#k~0#1.base, main_~#k~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-02-08 10:05:05,650 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-02-08 10:05:05,651 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:05:05,657 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:05:05,657 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:05:05,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:05 BoogieIcfgContainer [2025-02-08 10:05:05,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:05:05,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:05:05,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:05:05,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:05:05,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:05:05" (1/3) ... [2025-02-08 10:05:05,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a77c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:05, skipping insertion in model container [2025-02-08 10:05:05,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:05" (2/3) ... [2025-02-08 10:05:05,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a77c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:05, skipping insertion in model container [2025-02-08 10:05:05,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:05" (3/3) ... [2025-02-08 10:05:05,665 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps2.c [2025-02-08 10:05:05,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:05:05,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps2.c that has 3 procedures, 64 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-02-08 10:05:05,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:05:05,716 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;@6b81c501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:05:05,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 10:05:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 58 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 10:05:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 10:05:05,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:05,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 10:05:05,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_25_to_33_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:05,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash 88128663, now seen corresponding path program 1 times [2025-02-08 10:05:05,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:05,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135055719] [2025-02-08 10:05:05,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:05,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:05,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 10:05:05,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 10:05:05,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:05,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798883053] [2025-02-08 10:05:05,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:05,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:05,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:05,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:05,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 10:05:05,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 10:05:05,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 10:05:05,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:05,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:05,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 10:05:05,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:05,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:06,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135055719] [2025-02-08 10:05:06,022 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:06,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798883053] [2025-02-08 10:05:06,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798883053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:06,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:06,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:06,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287760016] [2025-02-08 10:05:06,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:06,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:06,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:06,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:06,038 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 58 states have internal predecessors, (60), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:06,196 INFO L93 Difference]: Finished difference Result 168 states and 185 transitions. [2025-02-08 10:05:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 10:05:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:06,202 INFO L225 Difference]: With dead ends: 168 [2025-02-08 10:05:06,203 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 10:05:06,205 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:05:06,206 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 75 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:06,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 247 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 10:05:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2025-02-08 10:05:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 67 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:05:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2025-02-08 10:05:06,233 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 5 [2025-02-08 10:05:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:06,233 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2025-02-08 10:05:06,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2025-02-08 10:05:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:05:06,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:06,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:06,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:06,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 10:05:06,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_33_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:06,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1207700747, now seen corresponding path program 1 times [2025-02-08 10:05:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027128564] [2025-02-08 10:05:06,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:06,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:05:06,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:05:06,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:06,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:06,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:06,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027128564] [2025-02-08 10:05:06,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027128564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:06,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:06,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:06,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624467882] [2025-02-08 10:05:06,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:06,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:06,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:06,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:06,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:06,686 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:06,769 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2025-02-08 10:05:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2025-02-08 10:05:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:06,771 INFO L225 Difference]: With dead ends: 97 [2025-02-08 10:05:06,771 INFO L226 Difference]: Without dead ends: 95 [2025-02-08 10:05:06,771 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:05:06,771 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 65 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:06,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 226 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-08 10:05:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2025-02-08 10:05:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6) internal successors, (72), 67 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:05:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2025-02-08 10:05:06,778 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 7 [2025-02-08 10:05:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:06,778 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2025-02-08 10:05:06,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2025-02-08 10:05:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 10:05:06,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:06,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:06,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:05:06,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_33_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash -959248045, now seen corresponding path program 1 times [2025-02-08 10:05:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969836595] [2025-02-08 10:05:06,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:06,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 10:05:06,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 10:05:06,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:06,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969836595] [2025-02-08 10:05:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969836595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:06,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:06,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:06,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507338122] [2025-02-08 10:05:06,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:06,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:06,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:06,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:06,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:06,987 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:07,122 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2025-02-08 10:05:07,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:07,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 10:05:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:07,123 INFO L225 Difference]: With dead ends: 95 [2025-02-08 10:05:07,123 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 10:05:07,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:07,124 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 61 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:07,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 260 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 10:05:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2025-02-08 10:05:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 67 states have internal predecessors, (71), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:05:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-02-08 10:05:07,130 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 9 [2025-02-08 10:05:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:07,130 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-02-08 10:05:07,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-02-08 10:05:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 10:05:07,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:07,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:07,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 10:05:07,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_33_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:07,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash 328081670, now seen corresponding path program 1 times [2025-02-08 10:05:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049024617] [2025-02-08 10:05:07,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:07,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 10:05:07,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 10:05:07,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:07,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:07,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:07,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049024617] [2025-02-08 10:05:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049024617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:07,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:07,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360396492] [2025-02-08 10:05:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:07,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:07,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:07,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:07,347 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:07,501 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2025-02-08 10:05:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:07,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 10:05:07,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:07,502 INFO L225 Difference]: With dead ends: 94 [2025-02-08 10:05:07,502 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 10:05:07,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:07,502 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 58 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:07,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 226 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 10:05:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2025-02-08 10:05:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 67 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:05:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-02-08 10:05:07,514 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 10 [2025-02-08 10:05:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:07,515 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-02-08 10:05:07,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-02-08 10:05:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 10:05:07,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:07,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:07,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 10:05:07,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_33_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:07,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1580597169, now seen corresponding path program 1 times [2025-02-08 10:05:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235150491] [2025-02-08 10:05:07,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:07,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 10:05:07,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 10:05:07,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:07,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:07,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:07,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235150491] [2025-02-08 10:05:07,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235150491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:07,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:07,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:07,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332915285] [2025-02-08 10:05:07,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:07,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:07,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:07,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:07,676 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:07,806 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2025-02-08 10:05:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 10:05:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:07,807 INFO L225 Difference]: With dead ends: 97 [2025-02-08 10:05:07,807 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 10:05:07,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:07,808 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 51 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:07,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 260 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 10:05:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2025-02-08 10:05:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 67 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:05:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2025-02-08 10:05:07,813 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 11 [2025-02-08 10:05:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:07,813 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2025-02-08 10:05:07,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2025-02-08 10:05:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 10:05:07,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:07,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:07,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 10:05:07,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_33_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:07,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1753871972, now seen corresponding path program 1 times [2025-02-08 10:05:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712491900] [2025-02-08 10:05:07,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:07,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:07,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 10:05:07,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 10:05:07,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:07,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:07,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712491900] [2025-02-08 10:05:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712491900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:07,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:07,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813133646] [2025-02-08 10:05:07,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:07,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:07,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:07,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:07,953 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:08,058 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-02-08 10:05:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:08,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 10:05:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:08,059 INFO L225 Difference]: With dead ends: 96 [2025-02-08 10:05:08,059 INFO L226 Difference]: Without dead ends: 95 [2025-02-08 10:05:08,060 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:05:08,060 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 48 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:08,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 229 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-08 10:05:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2025-02-08 10:05:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.511111111111111) internal successors, (68), 67 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:05:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2025-02-08 10:05:08,067 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 12 [2025-02-08 10:05:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:08,067 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2025-02-08 10:05:08,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2025-02-08 10:05:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 10:05:08,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:08,068 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] [2025-02-08 10:05:08,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 10:05:08,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_25_to_33_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:08,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:08,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1716788839, now seen corresponding path program 1 times [2025-02-08 10:05:08,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:08,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103226778] [2025-02-08 10:05:08,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:08,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 10:05:08,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 10:05:08,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:08,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:08,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103226778] [2025-02-08 10:05:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103226778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:08,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406938443] [2025-02-08 10:05:08,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:08,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:08,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:08,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:08,267 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:08,332 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2025-02-08 10:05:08,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:08,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 20 [2025-02-08 10:05:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:08,333 INFO L225 Difference]: With dead ends: 95 [2025-02-08 10:05:08,333 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 10:05:08,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:08,334 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:08,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 264 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 10:05:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2025-02-08 10:05:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5) internal successors, (69), 68 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:05:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2025-02-08 10:05:08,347 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 20 [2025-02-08 10:05:08,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:08,347 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2025-02-08 10:05:08,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2025-02-08 10:05:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 10:05:08,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:08,347 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:05:08,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 10:05:08,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_25_to_33_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:08,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1680846436, now seen corresponding path program 1 times [2025-02-08 10:05:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:08,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984539064] [2025-02-08 10:05:08,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:08,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 10:05:08,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 10:05:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:08,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:08,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984539064] [2025-02-08 10:05:08,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984539064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:08,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:08,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979192381] [2025-02-08 10:05:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:08,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:08,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:08,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:08,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:08,550 INFO L87 Difference]: Start difference. First operand 75 states and 78 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:05:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:08,645 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2025-02-08 10:05:08,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:08,646 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:05:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:08,646 INFO L225 Difference]: With dead ends: 94 [2025-02-08 10:05:08,646 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 10:05:08,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:08,650 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:08,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 305 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 10:05:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2025-02-08 10:05:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 69 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:05:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-02-08 10:05:08,658 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 21 [2025-02-08 10:05:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:08,658 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-02-08 10:05:08,659 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:05:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-02-08 10:05:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 10:05:08,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:08,659 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:05:08,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 10:05:08,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_33_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:08,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 566631941, now seen corresponding path program 1 times [2025-02-08 10:05:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995063462] [2025-02-08 10:05:08,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:08,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 10:05:08,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 10:05:08,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:08,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:08,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:08,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995063462] [2025-02-08 10:05:08,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995063462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:08,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:08,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129180803] [2025-02-08 10:05:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:08,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:08,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:08,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:08,815 INFO L87 Difference]: Start difference. First operand 76 states and 79 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:05:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:08,912 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2025-02-08 10:05:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:08,913 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:05:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:08,914 INFO L225 Difference]: With dead ends: 93 [2025-02-08 10:05:08,914 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 10:05:08,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:08,914 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:08,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 244 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 10:05:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2025-02-08 10:05:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.469387755102041) internal successors, (72), 71 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:05:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-02-08 10:05:08,918 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 22 [2025-02-08 10:05:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:08,918 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-02-08 10:05:08,919 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:05:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-02-08 10:05:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 10:05:08,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:08,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:08,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 10:05:08,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:08,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash 384743399, now seen corresponding path program 1 times [2025-02-08 10:05:08,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:08,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358554100] [2025-02-08 10:05:08,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:08,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:08,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:05:08,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:05:08,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:08,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:08,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185494218] [2025-02-08 10:05:08,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:08,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:08,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:08,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 10:05:08,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:05:09,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:05:09,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:09,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:09,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 10:05:09,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:09,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:09,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:09,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358554100] [2025-02-08 10:05:09,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185494218] [2025-02-08 10:05:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185494218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:09,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421536598] [2025-02-08 10:05:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:09,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:05:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:09,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:05:09,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:05:09,053 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:09,127 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2025-02-08 10:05:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:09,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-02-08 10:05:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:09,129 INFO L225 Difference]: With dead ends: 95 [2025-02-08 10:05:09,129 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 10:05:09,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:09,130 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 38 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:09,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 132 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 10:05:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2025-02-08 10:05:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 10:05:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2025-02-08 10:05:09,138 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 23 [2025-02-08 10:05:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:09,138 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2025-02-08 10:05:09,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2025-02-08 10:05:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 10:05:09,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:09,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:09,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 10:05:09,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:09,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:09,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash -927552093, now seen corresponding path program 1 times [2025-02-08 10:05:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:09,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474585013] [2025-02-08 10:05:09,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:09,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:09,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 10:05:09,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 10:05:09,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:09,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:09,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:09,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474585013] [2025-02-08 10:05:09,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474585013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:09,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:09,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:09,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401199061] [2025-02-08 10:05:09,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:09,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:09,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:09,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:09,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:09,599 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:09,685 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2025-02-08 10:05:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:09,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 24 [2025-02-08 10:05:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:09,686 INFO L225 Difference]: With dead ends: 86 [2025-02-08 10:05:09,686 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 10:05:09,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:09,686 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:09,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 263 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 10:05:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-02-08 10:05:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 75 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 10:05:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2025-02-08 10:05:09,691 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 24 [2025-02-08 10:05:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:09,691 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2025-02-08 10:05:09,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2025-02-08 10:05:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 10:05:09,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:09,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:09,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 10:05:09,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:09,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:09,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1310656160, now seen corresponding path program 1 times [2025-02-08 10:05:09,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:09,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906704260] [2025-02-08 10:05:09,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:09,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:09,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 10:05:09,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 10:05:09,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:09,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:09,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:09,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906704260] [2025-02-08 10:05:09,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906704260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:09,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:09,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:09,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461295335] [2025-02-08 10:05:09,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:09,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:09,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:09,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:09,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:09,907 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:09,996 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2025-02-08 10:05:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:09,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 25 [2025-02-08 10:05:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:09,997 INFO L225 Difference]: With dead ends: 86 [2025-02-08 10:05:09,997 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 10:05:09,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:09,998 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 23 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:09,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 268 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 10:05:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-08 10:05:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 76 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 10:05:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-02-08 10:05:10,004 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 25 [2025-02-08 10:05:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:10,004 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-02-08 10:05:10,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-02-08 10:05:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 10:05:10,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:10,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:10,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:05:10,006 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:10,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash 371219813, now seen corresponding path program 1 times [2025-02-08 10:05:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:10,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855673849] [2025-02-08 10:05:10,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:10,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 10:05:10,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 10:05:10,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:10,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855673849] [2025-02-08 10:05:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855673849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:10,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:10,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187965084] [2025-02-08 10:05:10,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:10,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:05:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:10,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:05:10,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:05:10,086 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:10,141 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2025-02-08 10:05:10,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:05:10,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-02-08 10:05:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:10,142 INFO L225 Difference]: With dead ends: 93 [2025-02-08 10:05:10,142 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 10:05:10,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:05:10,143 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:10,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 126 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 10:05:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2025-02-08 10:05:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 78 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 10:05:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-02-08 10:05:10,147 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 25 [2025-02-08 10:05:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:10,147 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-02-08 10:05:10,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-02-08 10:05:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 10:05:10,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:10,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:10,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 10:05:10,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:10,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 259955427, now seen corresponding path program 1 times [2025-02-08 10:05:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:10,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839188363] [2025-02-08 10:05:10,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:10,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 10:05:10,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 10:05:10,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:10,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:10,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:10,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839188363] [2025-02-08 10:05:10,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839188363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:10,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:10,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:10,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189493445] [2025-02-08 10:05:10,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:10,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:10,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:10,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:10,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:10,234 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:10,312 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-02-08 10:05:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:10,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-08 10:05:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:10,313 INFO L225 Difference]: With dead ends: 92 [2025-02-08 10:05:10,313 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 10:05:10,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:10,313 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:10,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 10:05:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2025-02-08 10:05:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.396551724137931) internal successors, (81), 79 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 10:05:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2025-02-08 10:05:10,318 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 27 [2025-02-08 10:05:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:10,318 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2025-02-08 10:05:10,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2025-02-08 10:05:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:05:10,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:10,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 10:05:10,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_25_to_33_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:10,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2079582305, now seen corresponding path program 1 times [2025-02-08 10:05:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:10,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078519180] [2025-02-08 10:05:10,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:10,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:10,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:10,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:10,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:10,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124355757] [2025-02-08 10:05:10,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:10,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:10,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:10,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:10,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 10:05:10,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:10,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:10,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:10,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:10,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 10:05:10,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:10,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:10,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 10:05:10,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 10:05:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:10,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:10,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078519180] [2025-02-08 10:05:10,904 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:10,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124355757] [2025-02-08 10:05:10,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124355757] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:05:10,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:05:10,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-02-08 10:05:10,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516674142] [2025-02-08 10:05:10,904 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:10,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 10:05:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:10,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 10:05:10,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-08 10:05:10,905 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 10 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:11,055 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2025-02-08 10:05:11,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 10:05:11,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 10:05:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:11,056 INFO L225 Difference]: With dead ends: 132 [2025-02-08 10:05:11,056 INFO L226 Difference]: Without dead ends: 131 [2025-02-08 10:05:11,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-02-08 10:05:11,057 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 96 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:11,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 335 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-08 10:05:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 110. [2025-02-08 10:05:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 97 states have internal predecessors, (106), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-08 10:05:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2025-02-08 10:05:11,062 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 29 [2025-02-08 10:05:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:11,062 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2025-02-08 10:05:11,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2025-02-08 10:05:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:05:11,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:11,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:11,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:11,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:11,264 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:11,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:11,264 INFO L85 PathProgramCache]: Analyzing trace with hash -531316337, now seen corresponding path program 1 times [2025-02-08 10:05:11,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:11,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518165127] [2025-02-08 10:05:11,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:11,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:11,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:05:11,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:05:11,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:11,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:11,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518165127] [2025-02-08 10:05:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518165127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:11,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:11,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960065131] [2025-02-08 10:05:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:11,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:05:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:11,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:05:11,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:05:11,374 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:11,463 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2025-02-08 10:05:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:05:11,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-02-08 10:05:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:11,465 INFO L225 Difference]: With dead ends: 114 [2025-02-08 10:05:11,465 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 10:05:11,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:05:11,465 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:11,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 10:05:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2025-02-08 10:05:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 98 states have internal predecessors, (107), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-08 10:05:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2025-02-08 10:05:11,470 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 28 [2025-02-08 10:05:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:11,470 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2025-02-08 10:05:11,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2025-02-08 10:05:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 10:05:11,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:11,471 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] [2025-02-08 10:05:11,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 10:05:11,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_25_to_33_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:11,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash -42542014, now seen corresponding path program 1 times [2025-02-08 10:05:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:11,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514259811] [2025-02-08 10:05:11,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:11,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:11,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:05:11,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:05:11,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:11,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910339162] [2025-02-08 10:05:11,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:11,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:11,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:11,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 10:05:11,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:05:11,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:05:11,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:11,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:11,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 10:05:11,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:11,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:11,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 10:05:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:11,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:13,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:13,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514259811] [2025-02-08 10:05:13,204 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:13,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910339162] [2025-02-08 10:05:13,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910339162] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:05:13,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:05:13,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-08 10:05:13,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401680915] [2025-02-08 10:05:13,205 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:13,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 10:05:13,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:13,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 10:05:13,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2025-02-08 10:05:13,206 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:13,409 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2025-02-08 10:05:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 10:05:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-02-08 10:05:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:13,410 INFO L225 Difference]: With dead ends: 130 [2025-02-08 10:05:13,410 INFO L226 Difference]: Without dead ends: 129 [2025-02-08 10:05:13,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=335, Unknown=1, NotChecked=0, Total=420 [2025-02-08 10:05:13,411 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 92 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:13,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 408 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-08 10:05:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2025-02-08 10:05:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.394736842105263) internal successors, (106), 98 states have internal predecessors, (106), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-08 10:05:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2025-02-08 10:05:13,418 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 30 [2025-02-08 10:05:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:13,418 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2025-02-08 10:05:13,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2025-02-08 10:05:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:05:13,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:13,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:13,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 10:05:13,624 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,SelfDestructingSolverStorable16 [2025-02-08 10:05:13,624 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:13,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash 709062753, now seen corresponding path program 1 times [2025-02-08 10:05:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969160496] [2025-02-08 10:05:13,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:13,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:13,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:13,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:13,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:13,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:13,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:13,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969160496] [2025-02-08 10:05:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969160496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:13,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:13,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:13,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360192913] [2025-02-08 10:05:13,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:13,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:13,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:13,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:13,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:13,767 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:13,878 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2025-02-08 10:05:13,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:13,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-02-08 10:05:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:13,879 INFO L225 Difference]: With dead ends: 114 [2025-02-08 10:05:13,879 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 10:05:13,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:13,880 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 20 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:13,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 183 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 10:05:13,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-02-08 10:05:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 99 states have internal predecessors, (107), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-08 10:05:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2025-02-08 10:05:13,884 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 29 [2025-02-08 10:05:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:13,884 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2025-02-08 10:05:13,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2025-02-08 10:05:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 10:05:13,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:13,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:13,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 10:05:13,885 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_25_to_33_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:13,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:13,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1318802435, now seen corresponding path program 1 times [2025-02-08 10:05:13,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:13,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974857016] [2025-02-08 10:05:13,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:13,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:13,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 10:05:13,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 10:05:13,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:13,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:14,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974857016] [2025-02-08 10:05:14,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974857016] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:05:14,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624328714] [2025-02-08 10:05:14,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:14,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:14,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:14,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:14,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 10:05:14,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 10:05:14,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 10:05:14,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:14,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:14,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 10:05:14,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:14,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:14,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:14,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 10:05:14,387 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:05:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:14,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:14,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624328714] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:05:14,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:05:14,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-08 10:05:14,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54111205] [2025-02-08 10:05:14,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:14,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 10:05:14,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:14,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 10:05:14,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-02-08 10:05:14,534 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 21 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:05:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:15,082 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2025-02-08 10:05:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 10:05:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-02-08 10:05:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:15,083 INFO L225 Difference]: With dead ends: 169 [2025-02-08 10:05:15,083 INFO L226 Difference]: Without dead ends: 167 [2025-02-08 10:05:15,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 10:05:15,084 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 252 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:15,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 508 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-08 10:05:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 136. [2025-02-08 10:05:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 120 states have internal predecessors, (139), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-08 10:05:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2025-02-08 10:05:15,090 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 31 [2025-02-08 10:05:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:15,090 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2025-02-08 10:05:15,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 17 states have internal predecessors, (59), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:05:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2025-02-08 10:05:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 10:05:15,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:15,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:15,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:15,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:15,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:15,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash 506108877, now seen corresponding path program 1 times [2025-02-08 10:05:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788545557] [2025-02-08 10:05:15,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:15,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:05:15,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:05:15,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:15,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:15,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:15,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788545557] [2025-02-08 10:05:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788545557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:15,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:15,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261062845] [2025-02-08 10:05:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:15,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:15,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:15,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:15,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:15,463 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:15,632 INFO L93 Difference]: Finished difference Result 138 states and 162 transitions. [2025-02-08 10:05:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:15,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-02-08 10:05:15,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:15,633 INFO L225 Difference]: With dead ends: 138 [2025-02-08 10:05:15,633 INFO L226 Difference]: Without dead ends: 126 [2025-02-08 10:05:15,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:15,634 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:15,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 157 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-08 10:05:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-02-08 10:05:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 111 states have internal predecessors, (129), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-08 10:05:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2025-02-08 10:05:15,640 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 30 [2025-02-08 10:05:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:15,640 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2025-02-08 10:05:15,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2025-02-08 10:05:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 10:05:15,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:15,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:15,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 10:05:15,641 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_25_to_33_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:15,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2066797472, now seen corresponding path program 1 times [2025-02-08 10:05:15,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:15,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667103971] [2025-02-08 10:05:15,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:15,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:15,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 10:05:15,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 10:05:15,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:15,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:15,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:15,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667103971] [2025-02-08 10:05:15,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667103971] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:05:15,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362932717] [2025-02-08 10:05:15,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:15,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:15,873 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:15,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 10:05:15,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 10:05:15,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 10:05:15,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:15,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:15,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 10:05:15,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:15,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:15,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:16,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 10:05:16,101 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:05:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:16,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:16,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362932717] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:05:16,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:05:16,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-08 10:05:16,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413091747] [2025-02-08 10:05:16,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:16,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 10:05:16,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:16,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 10:05:16,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-02-08 10:05:16,243 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand has 21 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:05:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:16,539 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2025-02-08 10:05:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 10:05:16,539 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-02-08 10:05:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:16,540 INFO L225 Difference]: With dead ends: 136 [2025-02-08 10:05:16,540 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 10:05:16,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2025-02-08 10:05:16,541 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 127 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:16,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 504 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 10:05:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2025-02-08 10:05:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 111 states have internal predecessors, (128), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-08 10:05:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2025-02-08 10:05:16,552 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 32 [2025-02-08 10:05:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:16,552 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2025-02-08 10:05:16,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:05:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2025-02-08 10:05:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 10:05:16,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:16,552 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:16,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 10:05:16,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 10:05:16,757 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_25_to_33_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:16,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:16,758 INFO L85 PathProgramCache]: Analyzing trace with hash -353787813, now seen corresponding path program 1 times [2025-02-08 10:05:16,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:16,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419512566] [2025-02-08 10:05:16,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:16,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 10:05:16,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 10:05:16,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:16,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:16,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99779926] [2025-02-08 10:05:16,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:16,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:16,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:16,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 10:05:16,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 10:05:16,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 10:05:16,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:16,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:16,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-08 10:05:16,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:16,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:16,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:16,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 10:05:17,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 10:05:17,079 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:05:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:17,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419512566] [2025-02-08 10:05:20,284 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99779926] [2025-02-08 10:05:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99779926] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:05:20,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:05:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-08 10:05:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445694580] [2025-02-08 10:05:20,284 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:20,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 10:05:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:20,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 10:05:20,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=286, Unknown=1, NotChecked=0, Total=342 [2025-02-08 10:05:20,290 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:20,601 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2025-02-08 10:05:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 10:05:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-02-08 10:05:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:20,604 INFO L225 Difference]: With dead ends: 134 [2025-02-08 10:05:20,604 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 10:05:20,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=104, Invalid=447, Unknown=1, NotChecked=0, Total=552 [2025-02-08 10:05:20,605 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 74 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:20,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 429 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 10:05:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2025-02-08 10:05:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 111 states have internal predecessors, (127), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-08 10:05:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 148 transitions. [2025-02-08 10:05:20,613 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 148 transitions. Word has length 33 [2025-02-08 10:05:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:20,613 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 148 transitions. [2025-02-08 10:05:20,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2025-02-08 10:05:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 10:05:20,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:20,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:20,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 10:05:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:20,814 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_25_to_33_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:20,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1917479678, now seen corresponding path program 1 times [2025-02-08 10:05:20,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:20,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451008930] [2025-02-08 10:05:20,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:20,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:20,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 10:05:20,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 10:05:20,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:20,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:21,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451008930] [2025-02-08 10:05:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451008930] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:05:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741149138] [2025-02-08 10:05:21,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:21,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:21,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:21,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 10:05:21,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 10:05:21,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 10:05:21,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:21,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:21,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 10:05:21,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:21,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:21,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:05:21,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 10:05:21,308 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:05:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:21,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:24,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741149138] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:05:24,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 10:05:24,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-02-08 10:05:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576469943] [2025-02-08 10:05:24,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:24,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 10:05:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:24,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 10:05:24,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=320, Unknown=2, NotChecked=0, Total=380 [2025-02-08 10:05:24,471 INFO L87 Difference]: Start difference. First operand 126 states and 148 transitions. Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:05:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:24,799 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2025-02-08 10:05:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 10:05:24,799 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-02-08 10:05:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:24,800 INFO L225 Difference]: With dead ends: 134 [2025-02-08 10:05:24,800 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 10:05:24,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=100, Invalid=498, Unknown=2, NotChecked=0, Total=600 [2025-02-08 10:05:24,801 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 68 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:24,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 498 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 10:05:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2025-02-08 10:05:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 111 states have internal predecessors, (126), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-08 10:05:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2025-02-08 10:05:24,806 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 34 [2025-02-08 10:05:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:24,806 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2025-02-08 10:05:24,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:05:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2025-02-08 10:05:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 10:05:24,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:24,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:24,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:25,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:25,011 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_25_to_33_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-02-08 10:05:25,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash -687672135, now seen corresponding path program 1 times [2025-02-08 10:05:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:25,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344923369] [2025-02-08 10:05:25,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:25,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:25,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 10:05:25,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 10:05:25,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:25,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat