./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5-ll.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_ps5-ll.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 02d2a7ecaeb1f9a3fd2c207ee063800bfd7475435ba7bc7e95648b1704092bfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:05:08,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:05:08,629 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:08,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:05:08,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:05:08,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:05:08,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:05:08,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:05:08,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:05:08,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:05:08,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:05:08,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:05:08,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:05:08,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:05:08,657 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:05:08,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:05:08,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:05:08,657 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:05:08,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:05:08,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:05:08,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:05:08,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:05:08,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:05:08,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:05:08,658 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:05:08,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:05:08,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:05:08,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:05:08,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:05:08,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:05:08,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:05:08,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:05:08,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:05:08,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:05:08,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:08,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:05:08,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:05:08,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:05:08,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:05:08,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:05:08,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:05:08,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:05:08,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:05:08,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:05:08,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:05:08,660 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 -> 02d2a7ecaeb1f9a3fd2c207ee063800bfd7475435ba7bc7e95648b1704092bfe [2025-02-08 10:05:08,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:05:08,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:05:08,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:05:08,909 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:05:08,909 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:05:08,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5-ll.c [2025-02-08 10:05:10,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/766fd66a1/674f43cccff34350b5619598b79c5fa7/FLAGe474a2d47 [2025-02-08 10:05:10,283 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:05:10,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps5-ll.c [2025-02-08 10:05:10,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/766fd66a1/674f43cccff34350b5619598b79c5fa7/FLAGe474a2d47 [2025-02-08 10:05:10,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/766fd66a1/674f43cccff34350b5619598b79c5fa7 [2025-02-08 10:05:10,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:05:10,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:05:10,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:10,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:05:10,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:05:10,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:10" (1/1) ... [2025-02-08 10:05:10,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9d265c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:10, skipping insertion in model container [2025-02-08 10:05:10,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:10" (1/1) ... [2025-02-08 10:05:10,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:05:10,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:10,491 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:05:10,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:10,530 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:05:10,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:10 WrapperNode [2025-02-08 10:05:10,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:10,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:10,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:05:10,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:05:10,535 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:10" (1/1) ... [2025-02-08 10:05:10,544 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:10" (1/1) ... [2025-02-08 10:05:10,567 INFO L138 Inliner]: procedures = 16, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 127 [2025-02-08 10:05:10,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:10,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:05:10,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:05:10,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:05:10,574 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:10" (1/1) ... [2025-02-08 10:05:10,574 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:10" (1/1) ... [2025-02-08 10:05:10,576 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:10" (1/1) ... [2025-02-08 10:05:10,589 INFO L175 MemorySlicer]: Split 51 memory accesses to 5 slices as follows [2, 5, 4, 36, 4]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 7 writes are split as follows [0, 2, 2, 2, 1]. [2025-02-08 10:05:10,592 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:10" (1/1) ... [2025-02-08 10:05:10,592 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:10" (1/1) ... [2025-02-08 10:05:10,596 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:10" (1/1) ... [2025-02-08 10:05:10,597 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:10" (1/1) ... [2025-02-08 10:05:10,597 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:10" (1/1) ... [2025-02-08 10:05:10,598 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:10" (1/1) ... [2025-02-08 10:05:10,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:05:10,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:05:10,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:05:10,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:05:10,605 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:10" (1/1) ... [2025-02-08 10:05:10,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:10,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:10,633 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:10,635 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:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:05:10,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:05:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:05:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:05:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:05:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:05:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:05:10,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:05:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_35_0 [2025-02-08 10:05:10,652 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_35_0 [2025-02-08 10:05:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:05:10,721 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:05:10,723 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:05:11,055 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:11,324 INFO L? ?]: Removed 369 outVars from TransFormulas that were not future-live. [2025-02-08 10:05:11,324 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:05:11,336 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:05:11,338 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:05:11,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:11 BoogieIcfgContainer [2025-02-08 10:05:11,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:05:11,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:05:11,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:05:11,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:05:11,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:05:10" (1/3) ... [2025-02-08 10:05:11,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716d0d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:11, skipping insertion in model container [2025-02-08 10:05:11,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:10" (2/3) ... [2025-02-08 10:05:11,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716d0d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:11, skipping insertion in model container [2025-02-08 10:05:11,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:11" (3/3) ... [2025-02-08 10:05:11,347 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps5-ll.c [2025-02-08 10:05:11,359 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:05:11,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps5-ll.c that has 3 procedures, 192 locations, 1 initial locations, 0 loop locations, and 84 error locations. [2025-02-08 10:05:11,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:05:11,423 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;@5cb85c5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:05:11,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-02-08 10:05:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 100 states have (on average 1.88) internal successors, (188), 185 states have internal predecessors, (188), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 10:05:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:05:11,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:11,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:11,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_27_to_35_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:11,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:11,434 INFO L85 PathProgramCache]: Analyzing trace with hash 785543471, now seen corresponding path program 1 times [2025-02-08 10:05:11,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:11,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241852537] [2025-02-08 10:05:11,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:11,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:05:11,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:05:11,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:11,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:11,590 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,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241852537] [2025-02-08 10:05:11,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241852537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:11,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:05:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518686099] [2025-02-08 10:05:11,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:11,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 10:05:11,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:11,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 10:05:11,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 10:05:11,609 INFO L87 Difference]: Start difference. First operand has 192 states, 100 states have (on average 1.88) internal successors, (188), 185 states have internal predecessors, (188), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:11,642 INFO L93 Difference]: Finished difference Result 382 states and 398 transitions. [2025-02-08 10:05:11,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 10:05:11,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:11,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:11,648 INFO L225 Difference]: With dead ends: 382 [2025-02-08 10:05:11,648 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 10:05:11,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 10:05:11,652 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:11,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 10:05:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-08 10:05:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 97 states have (on average 1.865979381443299) internal successors, (181), 181 states have internal predecessors, (181), 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:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 189 transitions. [2025-02-08 10:05:11,692 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 189 transitions. Word has length 7 [2025-02-08 10:05:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:11,693 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 189 transitions. [2025-02-08 10:05:11,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 189 transitions. [2025-02-08 10:05:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:05:11,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:11,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:11,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:05:11,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_27_to_35_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:11,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash 814172622, now seen corresponding path program 1 times [2025-02-08 10:05:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:11,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190115859] [2025-02-08 10:05:11,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:11,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:11,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:05:11,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:05:11,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:11,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:11,965 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,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:11,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190115859] [2025-02-08 10:05:11,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190115859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:11,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:11,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977834776] [2025-02-08 10:05:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:11,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:11,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:11,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:11,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:11,967 INFO L87 Difference]: Start difference. First operand 187 states and 189 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 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:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:12,287 INFO L93 Difference]: Finished difference Result 345 states and 350 transitions. [2025-02-08 10:05:12,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:12,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 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:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:12,289 INFO L225 Difference]: With dead ends: 345 [2025-02-08 10:05:12,291 INFO L226 Difference]: Without dead ends: 335 [2025-02-08 10:05:12,292 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:12,292 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 264 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:12,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 699 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-02-08 10:05:12,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 228. [2025-02-08 10:05:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.8014705882352942) internal successors, (245), 220 states have internal predecessors, (245), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 256 transitions. [2025-02-08 10:05:12,315 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 256 transitions. Word has length 7 [2025-02-08 10:05:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:12,315 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 256 transitions. [2025-02-08 10:05:12,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 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:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 256 transitions. [2025-02-08 10:05:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 10:05:12,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:12,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:12,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:05:12,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_35_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:12,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1351531612, now seen corresponding path program 1 times [2025-02-08 10:05:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49593427] [2025-02-08 10:05:12,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:12,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 10:05:12,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 10:05:12,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:12,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:12,535 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:12,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49593427] [2025-02-08 10:05:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49593427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:12,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:12,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:12,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936918073] [2025-02-08 10:05:12,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:12,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:12,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:12,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:12,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:12,539 INFO L87 Difference]: Start difference. First operand 228 states and 256 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:12,790 INFO L93 Difference]: Finished difference Result 335 states and 340 transitions. [2025-02-08 10:05:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:12,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 10:05:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:12,791 INFO L225 Difference]: With dead ends: 335 [2025-02-08 10:05:12,791 INFO L226 Difference]: Without dead ends: 327 [2025-02-08 10:05:12,792 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:12,792 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 220 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:12,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 698 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-08 10:05:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 228. [2025-02-08 10:05:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 220 states have internal predecessors, (237), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 248 transitions. [2025-02-08 10:05:12,803 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 248 transitions. Word has length 17 [2025-02-08 10:05:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:12,803 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 248 transitions. [2025-02-08 10:05:12,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2025-02-08 10:05:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 10:05:12,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:12,804 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:12,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 10:05:12,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_35_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:12,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash 935093532, now seen corresponding path program 1 times [2025-02-08 10:05:12,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:12,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115029322] [2025-02-08 10:05:12,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:12,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:12,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 10:05:12,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 10:05:12,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:12,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197100247] [2025-02-08 10:05:12,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:12,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:12,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:12,839 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:12,851 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:12,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 10:05:12,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 10:05:12,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:12,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:12,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 10:05:12,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:12,942 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:13,099 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,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:13,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:13,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115029322] [2025-02-08 10:05:13,100 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:13,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197100247] [2025-02-08 10:05:13,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197100247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:13,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:13,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617813369] [2025-02-08 10:05:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:13,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:13,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:13,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:13,102 INFO L87 Difference]: Start difference. First operand 228 states and 248 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:13,483 INFO L93 Difference]: Finished difference Result 327 states and 332 transitions. [2025-02-08 10:05:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:13,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 25 [2025-02-08 10:05:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:13,485 INFO L225 Difference]: With dead ends: 327 [2025-02-08 10:05:13,485 INFO L226 Difference]: Without dead ends: 326 [2025-02-08 10:05:13,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 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:13,485 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 243 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:13,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 689 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-08 10:05:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 228. [2025-02-08 10:05:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.7352941176470589) internal successors, (236), 220 states have internal predecessors, (236), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 247 transitions. [2025-02-08 10:05:13,493 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 247 transitions. Word has length 25 [2025-02-08 10:05:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:13,494 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 247 transitions. [2025-02-08 10:05:13,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2025-02-08 10:05:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 10:05:13,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:13,494 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] [2025-02-08 10:05:13,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 10:05:13,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:13,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_35_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:13,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1076871457, now seen corresponding path program 1 times [2025-02-08 10:05:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:13,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718242827] [2025-02-08 10:05:13,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:13,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:05:13,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:05:13,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:13,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714856154] [2025-02-08 10:05:13,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:13,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:13,724 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:13,726 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:13,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:05:13,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:05:13,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:13,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:13,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 10:05:13,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:13,790 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:13,878 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,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:13,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718242827] [2025-02-08 10:05:13,879 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714856154] [2025-02-08 10:05:13,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714856154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:13,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:13,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:13,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261432587] [2025-02-08 10:05:13,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:13,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:13,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:13,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:13,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:13,880 INFO L87 Difference]: Start difference. First operand 228 states and 247 transitions. Second operand has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:14,061 INFO L93 Difference]: Finished difference Result 326 states and 331 transitions. [2025-02-08 10:05:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:14,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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 26 [2025-02-08 10:05:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:14,063 INFO L225 Difference]: With dead ends: 326 [2025-02-08 10:05:14,063 INFO L226 Difference]: Without dead ends: 325 [2025-02-08 10:05:14,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:14,064 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 228 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:14,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 725 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-08 10:05:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2025-02-08 10:05:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.7279411764705883) internal successors, (235), 220 states have internal predecessors, (235), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 246 transitions. [2025-02-08 10:05:14,076 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 246 transitions. Word has length 26 [2025-02-08 10:05:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:14,079 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 246 transitions. [2025-02-08 10:05:14,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 246 transitions. [2025-02-08 10:05:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 10:05:14,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:14,080 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:14,087 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:14,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:14,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_35_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash 976723322, now seen corresponding path program 1 times [2025-02-08 10:05:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692561289] [2025-02-08 10:05:14,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:14,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 10:05:14,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 10:05:14,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:14,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:14,455 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:14,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:14,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692561289] [2025-02-08 10:05:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692561289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:14,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900053918] [2025-02-08 10:05:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:14,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:14,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:14,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:14,458 INFO L87 Difference]: Start difference. First operand 228 states and 246 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:14,637 INFO L93 Difference]: Finished difference Result 325 states and 330 transitions. [2025-02-08 10:05:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:14,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-08 10:05:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:14,639 INFO L225 Difference]: With dead ends: 325 [2025-02-08 10:05:14,639 INFO L226 Difference]: Without dead ends: 319 [2025-02-08 10:05:14,639 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:14,640 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 178 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:14,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 710 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-08 10:05:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 228. [2025-02-08 10:05:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.6838235294117647) internal successors, (229), 220 states have internal predecessors, (229), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 240 transitions. [2025-02-08 10:05:14,648 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 240 transitions. Word has length 27 [2025-02-08 10:05:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:14,648 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 240 transitions. [2025-02-08 10:05:14,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 240 transitions. [2025-02-08 10:05:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 10:05:14,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:14,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:14,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 10:05:14,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_35_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:14,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:14,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1363310956, now seen corresponding path program 1 times [2025-02-08 10:05:14,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:14,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822924704] [2025-02-08 10:05:14,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:14,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 10:05:14,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 10:05:14,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:14,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:14,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764831984] [2025-02-08 10:05:14,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:14,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:14,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:14,668 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:14,670 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:14,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 10:05:14,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 10:05:14,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:14,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:14,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 10:05:14,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:14,741 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,873 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:14,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:14,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:14,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822924704] [2025-02-08 10:05:14,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:14,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764831984] [2025-02-08 10:05:14,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764831984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:14,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:14,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:05:14,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700537896] [2025-02-08 10:05:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:14,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:05:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:14,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:05:14,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:14,875 INFO L87 Difference]: Start difference. First operand 228 states and 240 transitions. Second operand has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:15,094 INFO L93 Difference]: Finished difference Result 319 states and 324 transitions. [2025-02-08 10:05:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:15,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 33 [2025-02-08 10:05:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:15,096 INFO L225 Difference]: With dead ends: 319 [2025-02-08 10:05:15,096 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 10:05:15,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:05:15,097 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 190 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:15,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 722 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 10:05:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 228. [2025-02-08 10:05:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.6691176470588236) internal successors, (227), 220 states have internal predecessors, (227), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 238 transitions. [2025-02-08 10:05:15,102 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 238 transitions. Word has length 33 [2025-02-08 10:05:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:15,102 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 238 transitions. [2025-02-08 10:05:15,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 238 transitions. [2025-02-08 10:05:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 10:05:15,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:15,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:15,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 10:05:15,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:15,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_27_to_35_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:15,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -176800014, now seen corresponding path program 1 times [2025-02-08 10:05:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161757653] [2025-02-08 10:05:15,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:15,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 10:05:15,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 10:05:15,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:15,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:15,442 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,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:15,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161757653] [2025-02-08 10:05:15,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161757653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:15,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:15,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:15,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962563681] [2025-02-08 10:05:15,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:15,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:15,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:15,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:15,444 INFO L87 Difference]: Start difference. First operand 228 states and 238 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:15,522 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2025-02-08 10:05:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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 35 [2025-02-08 10:05:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:15,524 INFO L225 Difference]: With dead ends: 315 [2025-02-08 10:05:15,524 INFO L226 Difference]: Without dead ends: 313 [2025-02-08 10:05:15,524 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:15,524 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 167 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:15,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 870 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-08 10:05:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 228. [2025-02-08 10:05:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.6544117647058822) internal successors, (225), 220 states have internal predecessors, (225), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 236 transitions. [2025-02-08 10:05:15,533 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 236 transitions. Word has length 35 [2025-02-08 10:05:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:15,534 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 236 transitions. [2025-02-08 10:05:15,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 236 transitions. [2025-02-08 10:05:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 10:05:15,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:15,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 10:05:15,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_27_to_35_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:15,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1893881680, now seen corresponding path program 1 times [2025-02-08 10:05:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:15,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730083550] [2025-02-08 10:05:15,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:15,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:15,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 10:05:15,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 10:05:15,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:15,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:15,708 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,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:15,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730083550] [2025-02-08 10:05:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730083550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:15,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:15,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383879865] [2025-02-08 10:05:15,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:15,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:15,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:15,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:15,709 INFO L87 Difference]: Start difference. First operand 228 states and 236 transitions. Second operand has 7 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:16,080 INFO L93 Difference]: Finished difference Result 313 states and 317 transitions. [2025-02-08 10:05:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:16,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-08 10:05:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:16,082 INFO L225 Difference]: With dead ends: 313 [2025-02-08 10:05:16,082 INFO L226 Difference]: Without dead ends: 312 [2025-02-08 10:05:16,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:16,082 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 170 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:16,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 841 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:16,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-08 10:05:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 228. [2025-02-08 10:05:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 220 states have internal predecessors, (224), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 235 transitions. [2025-02-08 10:05:16,090 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 235 transitions. Word has length 37 [2025-02-08 10:05:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:16,091 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 235 transitions. [2025-02-08 10:05:16,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 235 transitions. [2025-02-08 10:05:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 10:05:16,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:16,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:16,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 10:05:16,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_27_to_35_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:16,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1419209965, now seen corresponding path program 1 times [2025-02-08 10:05:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964646319] [2025-02-08 10:05:16,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:16,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:16,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 10:05:16,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 10:05:16,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:16,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:16,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:16,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964646319] [2025-02-08 10:05:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964646319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:16,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196897259] [2025-02-08 10:05:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:16,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:16,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:16,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:16,252 INFO L87 Difference]: Start difference. First operand 228 states and 235 transitions. Second operand has 6 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:16,556 INFO L93 Difference]: Finished difference Result 312 states and 316 transitions. [2025-02-08 10:05:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:16,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 38 [2025-02-08 10:05:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:16,558 INFO L225 Difference]: With dead ends: 312 [2025-02-08 10:05:16,558 INFO L226 Difference]: Without dead ends: 311 [2025-02-08 10:05:16,558 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:16,559 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 160 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:16,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 818 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-08 10:05:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 228. [2025-02-08 10:05:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.6397058823529411) internal successors, (223), 220 states have internal predecessors, (223), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 234 transitions. [2025-02-08 10:05:16,580 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 234 transitions. Word has length 38 [2025-02-08 10:05:16,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:16,581 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 234 transitions. [2025-02-08 10:05:16,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 234 transitions. [2025-02-08 10:05:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 10:05:16,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:16,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:16,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 10:05:16,582 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_27_to_35_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:16,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1045835858, now seen corresponding path program 1 times [2025-02-08 10:05:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:16,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937661627] [2025-02-08 10:05:16,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:16,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:16,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 10:05:16,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 10:05:16,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:16,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:16,734 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:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937661627] [2025-02-08 10:05:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937661627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:16,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:16,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:16,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227414918] [2025-02-08 10:05:16,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:16,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:16,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:16,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:16,735 INFO L87 Difference]: Start difference. First operand 228 states and 234 transitions. Second operand has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:17,033 INFO L93 Difference]: Finished difference Result 313 states and 318 transitions. [2025-02-08 10:05:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:17,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-08 10:05:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:17,034 INFO L225 Difference]: With dead ends: 313 [2025-02-08 10:05:17,034 INFO L226 Difference]: Without dead ends: 312 [2025-02-08 10:05:17,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:17,035 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 141 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:17,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 708 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-08 10:05:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 228. [2025-02-08 10:05:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 220 states have internal predecessors, (222), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 233 transitions. [2025-02-08 10:05:17,041 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 233 transitions. Word has length 39 [2025-02-08 10:05:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:17,041 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 233 transitions. [2025-02-08 10:05:17,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 233 transitions. [2025-02-08 10:05:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 10:05:17,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:17,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:17,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 10:05:17,042 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_27_to_35_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:17,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:17,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1938826865, now seen corresponding path program 1 times [2025-02-08 10:05:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992965896] [2025-02-08 10:05:17,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:17,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 10:05:17,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 10:05:17,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:17,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:17,160 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:17,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992965896] [2025-02-08 10:05:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992965896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:17,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925749603] [2025-02-08 10:05:17,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:17,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:17,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:17,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:17,161 INFO L87 Difference]: Start difference. First operand 228 states and 233 transitions. Second operand has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:17,370 INFO L93 Difference]: Finished difference Result 312 states and 317 transitions. [2025-02-08 10:05:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:17,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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 40 [2025-02-08 10:05:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:17,371 INFO L225 Difference]: With dead ends: 312 [2025-02-08 10:05:17,372 INFO L226 Difference]: Without dead ends: 311 [2025-02-08 10:05:17,372 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:17,372 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 135 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:17,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 701 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-08 10:05:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 228. [2025-02-08 10:05:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.625) internal successors, (221), 220 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 232 transitions. [2025-02-08 10:05:17,385 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 232 transitions. Word has length 40 [2025-02-08 10:05:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:17,385 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 232 transitions. [2025-02-08 10:05:17,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2025-02-08 10:05:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 10:05:17,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:17,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:17,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:05:17,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_27_to_35_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:17,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1127220182, now seen corresponding path program 1 times [2025-02-08 10:05:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867264244] [2025-02-08 10:05:17,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:17,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:17,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 10:05:17,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 10:05:17,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:17,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:17,544 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:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867264244] [2025-02-08 10:05:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867264244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:17,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137379538] [2025-02-08 10:05:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:17,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:17,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:17,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:17,546 INFO L87 Difference]: Start difference. First operand 228 states and 232 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:17,611 INFO L93 Difference]: Finished difference Result 311 states and 315 transitions. [2025-02-08 10:05:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:17,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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 48 [2025-02-08 10:05:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:17,612 INFO L225 Difference]: With dead ends: 311 [2025-02-08 10:05:17,612 INFO L226 Difference]: Without dead ends: 310 [2025-02-08 10:05:17,613 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:17,613 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 125 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:17,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1068 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-08 10:05:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 229. [2025-02-08 10:05:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 221 states have internal predecessors, (222), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2025-02-08 10:05:17,621 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 48 [2025-02-08 10:05:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:17,621 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2025-02-08 10:05:17,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2025-02-08 10:05:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 10:05:17,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:17,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:17,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 10:05:17,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_27_to_35_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:17,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:17,623 INFO L85 PathProgramCache]: Analyzing trace with hash -584087189, now seen corresponding path program 1 times [2025-02-08 10:05:17,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:17,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670757774] [2025-02-08 10:05:17,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:17,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:17,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 10:05:17,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 10:05:17,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:17,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:17,798 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:17,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670757774] [2025-02-08 10:05:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670757774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:17,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507467145] [2025-02-08 10:05:17,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:17,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:17,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:17,800 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:17,875 INFO L93 Difference]: Finished difference Result 229 states and 233 transitions. [2025-02-08 10:05:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:17,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 49 [2025-02-08 10:05:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:17,877 INFO L225 Difference]: With dead ends: 229 [2025-02-08 10:05:17,878 INFO L226 Difference]: Without dead ends: 228 [2025-02-08 10:05:17,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:17,878 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 227 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:17,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 793 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-08 10:05:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-02-08 10:05:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 220 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 232 transitions. [2025-02-08 10:05:17,884 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 232 transitions. Word has length 49 [2025-02-08 10:05:17,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:17,884 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 232 transitions. [2025-02-08 10:05:17,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2025-02-08 10:05:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 10:05:17,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:17,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:17,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 10:05:17,885 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_27_to_35_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:17,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:17,886 INFO L85 PathProgramCache]: Analyzing trace with hash -926833592, now seen corresponding path program 1 times [2025-02-08 10:05:17,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:17,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937936683] [2025-02-08 10:05:17,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:17,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:17,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 10:05:17,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 10:05:17,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:17,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:18,013 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:18,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:18,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937936683] [2025-02-08 10:05:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937936683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007274922] [2025-02-08 10:05:18,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:18,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:18,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:18,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:18,015 INFO L87 Difference]: Start difference. First operand 228 states and 232 transitions. Second operand has 6 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:18,148 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions. [2025-02-08 10:05:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:18,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 50 [2025-02-08 10:05:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:18,149 INFO L225 Difference]: With dead ends: 308 [2025-02-08 10:05:18,149 INFO L226 Difference]: Without dead ends: 306 [2025-02-08 10:05:18,150 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:18,150 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 121 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:18,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 752 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-08 10:05:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 231. [2025-02-08 10:05:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 140 states have (on average 1.6) internal successors, (224), 223 states have internal predecessors, (224), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2025-02-08 10:05:18,162 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 50 [2025-02-08 10:05:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:18,162 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2025-02-08 10:05:18,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2025-02-08 10:05:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 10:05:18,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:18,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:18,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 10:05:18,164 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:18,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:18,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1333518895, now seen corresponding path program 1 times [2025-02-08 10:05:18,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:18,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376476583] [2025-02-08 10:05:18,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:18,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 10:05:18,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 10:05:18,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:18,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:18,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:18,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:18,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376476583] [2025-02-08 10:05:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376476583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:18,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:18,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:18,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007876602] [2025-02-08 10:05:18,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:18,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:05:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:18,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:05:18,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:05:18,265 INFO L87 Difference]: Start difference. First operand 231 states and 235 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:18,445 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions. [2025-02-08 10:05:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:05:18,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 51 [2025-02-08 10:05:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:18,446 INFO L225 Difference]: With dead ends: 308 [2025-02-08 10:05:18,446 INFO L226 Difference]: Without dead ends: 298 [2025-02-08 10:05:18,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:18,447 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 157 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:18,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 464 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-08 10:05:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 244. [2025-02-08 10:05:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 152 states have (on average 1.5526315789473684) internal successors, (236), 234 states have internal predecessors, (236), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-08 10:05:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 248 transitions. [2025-02-08 10:05:18,455 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 248 transitions. Word has length 51 [2025-02-08 10:05:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:18,455 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 248 transitions. [2025-02-08 10:05:18,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 248 transitions. [2025-02-08 10:05:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 10:05:18,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:18,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:18,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 10:05:18,456 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_27_to_35_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:18,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1628849050, now seen corresponding path program 1 times [2025-02-08 10:05:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:18,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196742046] [2025-02-08 10:05:18,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:18,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 10:05:18,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 10:05:18,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:18,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:18,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871414984] [2025-02-08 10:05:18,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:18,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:18,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:18,483 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:18,484 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:18,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 10:05:18,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 10:05:18,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:18,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:18,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 10:05:18,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:18,569 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:18,703 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:18,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:18,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:18,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196742046] [2025-02-08 10:05:18,704 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:18,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871414984] [2025-02-08 10:05:18,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871414984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:18,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:18,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:05:18,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409977291] [2025-02-08 10:05:18,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:18,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:05:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:18,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:05:18,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:18,705 INFO L87 Difference]: Start difference. First operand 244 states and 248 transitions. Second operand has 8 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 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:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:18,883 INFO L93 Difference]: Finished difference Result 315 states and 325 transitions. [2025-02-08 10:05:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 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 52 [2025-02-08 10:05:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:18,885 INFO L225 Difference]: With dead ends: 315 [2025-02-08 10:05:18,885 INFO L226 Difference]: Without dead ends: 314 [2025-02-08 10:05:18,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:18,885 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 185 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:18,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 586 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-08 10:05:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 274. [2025-02-08 10:05:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 180 states have (on average 1.6) internal successors, (288), 263 states have internal predecessors, (288), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2025-02-08 10:05:18,892 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 52 [2025-02-08 10:05:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:18,892 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2025-02-08 10:05:18,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 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:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2025-02-08 10:05:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 10:05:18,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:18,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:18,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:19,093 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:19,094 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_27_to_35_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:19,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1045287079, now seen corresponding path program 1 times [2025-02-08 10:05:19,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:19,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984338588] [2025-02-08 10:05:19,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:19,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:19,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 10:05:19,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 10:05:19,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:19,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:19,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1610850887] [2025-02-08 10:05:19,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:19,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:19,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:19,119 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:19,121 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:19,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 10:05:19,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 10:05:19,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:19,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:19,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 10:05:19,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:19,205 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:19,325 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:19,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:19,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:19,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984338588] [2025-02-08 10:05:19,325 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:19,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610850887] [2025-02-08 10:05:19,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610850887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:19,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:19,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:05:19,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374788980] [2025-02-08 10:05:19,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:19,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:05:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:19,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:05:19,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:19,327 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand has 8 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:19,560 INFO L93 Difference]: Finished difference Result 315 states and 324 transitions. [2025-02-08 10:05:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:19,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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 53 [2025-02-08 10:05:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:19,562 INFO L225 Difference]: With dead ends: 315 [2025-02-08 10:05:19,562 INFO L226 Difference]: Without dead ends: 314 [2025-02-08 10:05:19,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:19,562 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 118 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:19,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 959 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-08 10:05:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 275. [2025-02-08 10:05:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 181 states have (on average 1.5966850828729282) internal successors, (289), 264 states have internal predecessors, (289), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2025-02-08 10:05:19,570 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 53 [2025-02-08 10:05:19,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:19,570 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2025-02-08 10:05:19,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2025-02-08 10:05:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 10:05:19,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:19,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:19,577 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:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 10:05:19,771 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_27_to_35_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1955838844, now seen corresponding path program 1 times [2025-02-08 10:05:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810959227] [2025-02-08 10:05:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:19,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 10:05:19,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 10:05:19,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:19,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:19,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702182408] [2025-02-08 10:05:19,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:19,789 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:19,790 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:19,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 10:05:19,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 10:05:19,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:19,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:19,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 10:05:19,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:19,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:19,983 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:20,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-08 10:05:20,023 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:20,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:20,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:20,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810959227] [2025-02-08 10:05:20,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:20,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702182408] [2025-02-08 10:05:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702182408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:20,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:20,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 10:05:20,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552696715] [2025-02-08 10:05:20,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:20,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:05:20,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:20,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:05:20,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:20,025 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:20,245 INFO L93 Difference]: Finished difference Result 315 states and 323 transitions. [2025-02-08 10:05:20,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:05:20,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 10:05:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:20,246 INFO L225 Difference]: With dead ends: 315 [2025-02-08 10:05:20,246 INFO L226 Difference]: Without dead ends: 314 [2025-02-08 10:05:20,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:05:20,247 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 189 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:20,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 778 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-08 10:05:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 276. [2025-02-08 10:05:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 182 states have (on average 1.5934065934065933) internal successors, (290), 265 states have internal predecessors, (290), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2025-02-08 10:05:20,257 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 54 [2025-02-08 10:05:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:20,258 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2025-02-08 10:05:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2025-02-08 10:05:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 10:05:20,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:20,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:20,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:20,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:20,459 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_27_to_35_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:20,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash -501461947, now seen corresponding path program 1 times [2025-02-08 10:05:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:20,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560224944] [2025-02-08 10:05:20,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:20,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:20,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 10:05:20,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 10:05:20,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:20,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:20,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893062200] [2025-02-08 10:05:20,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:20,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:20,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:20,478 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:20,480 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:20,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 10:05:20,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 10:05:20,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:20,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:20,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 10:05:20,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:20,560 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:20,656 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:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:20,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:20,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:20,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560224944] [2025-02-08 10:05:20,687 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893062200] [2025-02-08 10:05:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893062200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:20,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:20,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 10:05:20,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181533408] [2025-02-08 10:05:20,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:20,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:05:20,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:20,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:05:20,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:20,689 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:20,936 INFO L93 Difference]: Finished difference Result 315 states and 322 transitions. [2025-02-08 10:05:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:05:20,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-08 10:05:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:20,937 INFO L225 Difference]: With dead ends: 315 [2025-02-08 10:05:20,937 INFO L226 Difference]: Without dead ends: 314 [2025-02-08 10:05:20,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:05:20,938 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 186 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:20,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 808 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-08 10:05:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 277. [2025-02-08 10:05:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 183 states have (on average 1.5901639344262295) internal successors, (291), 266 states have internal predecessors, (291), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 305 transitions. [2025-02-08 10:05:20,948 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 305 transitions. Word has length 55 [2025-02-08 10:05:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:20,948 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 305 transitions. [2025-02-08 10:05:20,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 305 transitions. [2025-02-08 10:05:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 10:05:20,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:20,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:20,956 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:21,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:21,150 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_27_to_35_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:21,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1634548898, now seen corresponding path program 1 times [2025-02-08 10:05:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283845651] [2025-02-08 10:05:21,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:21,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 10:05:21,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 10:05:21,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:21,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:21,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369922454] [2025-02-08 10:05:21,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:21,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:21,172 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,174 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,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 10:05:21,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 10:05:21,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:21,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:21,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 10:05:21,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:21,283 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,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:21,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-02-08 10:05:21,447 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:21,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:21,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:21,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283845651] [2025-02-08 10:05:21,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:21,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369922454] [2025-02-08 10:05:21,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369922454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:21,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:21,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 10:05:21,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919641553] [2025-02-08 10:05:21,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:21,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 10:05:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:21,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 10:05:21,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:21,448 INFO L87 Difference]: Start difference. First operand 277 states and 305 transitions. Second operand has 10 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:21,689 INFO L93 Difference]: Finished difference Result 315 states and 321 transitions. [2025-02-08 10:05:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:05:21,692 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-02-08 10:05:21,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:21,693 INFO L225 Difference]: With dead ends: 315 [2025-02-08 10:05:21,693 INFO L226 Difference]: Without dead ends: 314 [2025-02-08 10:05:21,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 10:05:21,693 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 187 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:21,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1005 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-08 10:05:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 278. [2025-02-08 10:05:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 184 states have (on average 1.5869565217391304) internal successors, (292), 267 states have internal predecessors, (292), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2025-02-08 10:05:21,701 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 56 [2025-02-08 10:05:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:21,701 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2025-02-08 10:05:21,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2025-02-08 10:05:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 10:05:21,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:21,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:21,708 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:21,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:21,906 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_27_to_35_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:21,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:21,906 INFO L85 PathProgramCache]: Analyzing trace with hash -868591645, now seen corresponding path program 1 times [2025-02-08 10:05:21,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:21,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042910065] [2025-02-08 10:05:21,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:21,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:21,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 10:05:21,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 10:05:21,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:21,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:21,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994001155] [2025-02-08 10:05:21,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:21,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:21,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:21,929 INFO L229 MonitoredProcess]: Starting monitored process 10 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,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 10:05:21,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 10:05:22,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 10:05:22,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:22,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:22,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 10:05:22,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:22,021 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:22,112 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:22,177 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:22,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:22,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:22,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042910065] [2025-02-08 10:05:22,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:22,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994001155] [2025-02-08 10:05:22,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994001155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:22,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:22,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 10:05:22,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095232205] [2025-02-08 10:05:22,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:22,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 10:05:22,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:22,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 10:05:22,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:22,179 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 10 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 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:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:22,460 INFO L93 Difference]: Finished difference Result 315 states and 320 transitions. [2025-02-08 10:05:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:05:22,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 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 57 [2025-02-08 10:05:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:22,461 INFO L225 Difference]: With dead ends: 315 [2025-02-08 10:05:22,461 INFO L226 Difference]: Without dead ends: 314 [2025-02-08 10:05:22,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 10:05:22,462 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 122 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:22,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 975 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-08 10:05:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 279. [2025-02-08 10:05:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 185 states have (on average 1.5837837837837838) internal successors, (293), 268 states have internal predecessors, (293), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2025-02-08 10:05:22,469 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 57 [2025-02-08 10:05:22,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:22,469 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2025-02-08 10:05:22,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 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:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2025-02-08 10:05:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 10:05:22,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:22,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:22,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 10:05:22,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:22,674 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_27_to_35_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-08 10:05:22,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1156537152, now seen corresponding path program 1 times [2025-02-08 10:05:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:22,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499309874] [2025-02-08 10:05:22,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:22,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 10:05:22,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 10:05:22,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:22,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat