./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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_sqrt1-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 ac02a57e98f6481647f49b84c91fda6d0505e35fbffb37ed6b508f20e911a1af --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:36:49,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:36:49,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:36:49,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:36:49,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:36:49,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:36:49,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:36:49,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:36:49,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:36:49,616 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:36:49,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:36:49,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:36:49,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:36:49,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:36:49,617 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:36:49,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:36:49,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:36:49,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:36:49,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:36:49,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:36:49,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:36:49,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:36:49,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:36:49,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:36:49,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:36:49,620 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 -> ac02a57e98f6481647f49b84c91fda6d0505e35fbffb37ed6b508f20e911a1af [2025-02-06 14:36:49,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:36:49,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:36:49,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:36:49,832 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:36:49,832 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:36:49,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1-ll.c [2025-02-06 14:36:50,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48aea5747/5b2b13c5f4ae4d46bf92582bc6474b10/FLAGa7bf94727 [2025-02-06 14:36:51,151 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:36:51,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1-ll.c [2025-02-06 14:36:51,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48aea5747/5b2b13c5f4ae4d46bf92582bc6474b10/FLAGa7bf94727 [2025-02-06 14:36:51,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48aea5747/5b2b13c5f4ae4d46bf92582bc6474b10 [2025-02-06 14:36:51,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:36:51,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:36:51,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:36:51,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:36:51,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:36:51,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36055fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51, skipping insertion in model container [2025-02-06 14:36:51,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:36:51,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:36:51,662 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:36:51,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:36:51,686 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:36:51,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51 WrapperNode [2025-02-06 14:36:51,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:36:51,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:36:51,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:36:51,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:36:51,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,715 INFO L138 Inliner]: procedures = 16, calls = 59, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2025-02-06 14:36:51,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:36:51,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:36:51,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:36:51,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:36:51,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,739 INFO L175 MemorySlicer]: Split 33 memory accesses to 5 slices as follows [2, 2, 9, 8, 12]. 36 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, 1, 2, 2, 2]. [2025-02-06 14:36:51,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:36:51,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:36:51,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:36:51,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:36:51,750 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (1/1) ... [2025-02-06 14:36:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:36:51,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:51,774 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-06 14:36:51,776 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-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 14:36:51,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 14:36:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 14:36:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 14:36:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_29_to_40_0 [2025-02-06 14:36:51,793 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_29_to_40_0 [2025-02-06 14:36:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:36:51,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:36:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 14:36:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 14:36:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 14:36:51,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 14:36:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 14:36:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:36:51,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:36:51,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 14:36:51,859 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:36:51,860 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:36:52,105 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L76: call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~0#1.offset;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset;call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset);havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-06 14:36:52,132 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-02-06 14:36:52,132 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:36:52,143 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:36:52,143 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:36:52,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:52 BoogieIcfgContainer [2025-02-06 14:36:52,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:36:52,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:36:52,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:36:52,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:36:52,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:36:51" (1/3) ... [2025-02-06 14:36:52,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb280b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:52, skipping insertion in model container [2025-02-06 14:36:52,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:51" (2/3) ... [2025-02-06 14:36:52,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb280b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:52, skipping insertion in model container [2025-02-06 14:36:52,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:52" (3/3) ... [2025-02-06 14:36:52,155 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_sqrt1-ll.c [2025-02-06 14:36:52,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:36:52,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_sqrt1-ll.c that has 3 procedures, 131 locations, 1 initial locations, 0 loop locations, and 50 error locations. [2025-02-06 14:36:52,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:36:52,210 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;@43a171ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:36:52,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-06 14:36:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 121 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 14:36:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:36:52,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:52,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:36:52,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_29_to_40_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:36:52,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash 349309519, now seen corresponding path program 1 times [2025-02-06 14:36:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698814830] [2025-02-06 14:36:52,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:52,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:36:52,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:36:52,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:52,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:52,541 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-06 14:36:52,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698814830] [2025-02-06 14:36:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698814830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:52,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:36:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614817500] [2025-02-06 14:36:52,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:52,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:36:52,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:52,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:36:52,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:36:52,572 INFO L87 Difference]: Start difference. First operand has 131 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 121 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-06 14:36:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:52,730 INFO L93 Difference]: Finished difference Result 328 states and 365 transitions. [2025-02-06 14:36:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:36:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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 6 [2025-02-06 14:36:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:52,735 INFO L225 Difference]: With dead ends: 328 [2025-02-06 14:36:52,735 INFO L226 Difference]: Without dead ends: 194 [2025-02-06 14:36:52,738 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-06 14:36:52,739 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 118 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:52,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 588 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-06 14:36:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 157. [2025-02-06 14:36:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.7340425531914894) internal successors, (163), 144 states have internal predecessors, (163), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-06 14:36:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2025-02-06 14:36:52,777 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 6 [2025-02-06 14:36:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:52,777 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2025-02-06 14:36:52,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-06 14:36:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2025-02-06 14:36:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 14:36:52,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:52,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:52,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:36:52,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_29_to_40_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:36:52,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1938355172, now seen corresponding path program 1 times [2025-02-06 14:36:52,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:52,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387437599] [2025-02-06 14:36:52,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:52,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:36:52,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:36:52,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:52,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:52,956 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-06 14:36:52,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387437599] [2025-02-06 14:36:52,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387437599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:52,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:36:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044166224] [2025-02-06 14:36:52,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:52,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:36:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:52,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:36:52,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:36:52,959 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-06 14:36:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:53,082 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2025-02-06 14:36:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:36:53,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2025-02-06 14:36:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:53,083 INFO L225 Difference]: With dead ends: 194 [2025-02-06 14:36:53,084 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 14:36:53,084 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-06 14:36:53,085 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 113 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:53,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 553 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 14:36:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2025-02-06 14:36:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 144 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-06 14:36:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2025-02-06 14:36:53,100 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 16 [2025-02-06 14:36:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:53,100 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2025-02-06 14:36:53,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-06 14:36:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2025-02-06 14:36:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 14:36:53,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:53,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:53,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:36:53,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_29_to_40_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:36:53,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:53,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1256485438, now seen corresponding path program 1 times [2025-02-06 14:36:53,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:53,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599813222] [2025-02-06 14:36:53,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:53,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:53,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 14:36:53,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 14:36:53,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:53,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:53,247 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-06 14:36:53,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599813222] [2025-02-06 14:36:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599813222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:36:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889170807] [2025-02-06 14:36:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:53,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:36:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:53,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:36:53,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:36:53,249 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-06 14:36:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:53,349 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2025-02-06 14:36:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:36:53,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2025-02-06 14:36:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:53,350 INFO L225 Difference]: With dead ends: 192 [2025-02-06 14:36:53,350 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 14:36:53,351 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-06 14:36:53,351 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:53,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 550 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 14:36:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 157. [2025-02-06 14:36:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 144 states have internal predecessors, (159), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-06 14:36:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2025-02-06 14:36:53,364 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 18 [2025-02-06 14:36:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:53,365 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2025-02-06 14:36:53,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-06 14:36:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2025-02-06 14:36:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 14:36:53,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:53,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:53,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:36:53,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_29_to_40_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:36:53,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash -596695136, now seen corresponding path program 1 times [2025-02-06 14:36:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510704309] [2025-02-06 14:36:53,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:53,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 14:36:53,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 14:36:53,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:53,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:53,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675384344] [2025-02-06 14:36:53,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:53,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:53,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:53,396 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-06 14:36:53,397 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-06 14:36:53,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 14:36:53,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 14:36:53,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:53,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:53,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 14:36:53,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:53,483 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-06 14:36:53,608 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-06 14:36:53,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:53,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510704309] [2025-02-06 14:36:53,609 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675384344] [2025-02-06 14:36:53,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675384344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:53,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:53,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 14:36:53,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796161836] [2025-02-06 14:36:53,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:53,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 14:36:53,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:53,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 14:36:53,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:36:53,611 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:53,889 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2025-02-06 14:36:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:36:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-02-06 14:36:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:53,890 INFO L225 Difference]: With dead ends: 216 [2025-02-06 14:36:53,891 INFO L226 Difference]: Without dead ends: 214 [2025-02-06 14:36:53,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-02-06 14:36:53,891 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 170 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:53,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 976 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:36:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-06 14:36:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 157. [2025-02-06 14:36:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.6702127659574468) internal successors, (157), 144 states have internal predecessors, (157), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-06 14:36:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2025-02-06 14:36:53,920 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 20 [2025-02-06 14:36:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:53,920 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2025-02-06 14:36:53,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2025-02-06 14:36:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 14:36:53,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:53,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:53,927 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-06 14:36:54,121 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-06 14:36:54,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_29_to_40_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:36:54,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1726467553, now seen corresponding path program 1 times [2025-02-06 14:36:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990288019] [2025-02-06 14:36:54,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:54,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 14:36:54,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 14:36:54,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:54,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:54,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1432709012] [2025-02-06 14:36:54,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:54,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:54,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:54,142 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-06 14:36:54,143 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-06 14:36:54,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 14:36:54,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 14:36:54,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:54,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:54,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 14:36:54,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:54,210 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-06 14:36:54,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 14:36:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:54,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:36:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990288019] [2025-02-06 14:36:54,424 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:54,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432709012] [2025-02-06 14:36:54,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432709012] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:36:54,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:36:54,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-06 14:36:54,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853915587] [2025-02-06 14:36:54,425 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:36:54,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 14:36:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:54,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 14:36:54,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:36:54,426 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:36:58,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:02,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:06,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:06,778 INFO L93 Difference]: Finished difference Result 230 states and 239 transitions. [2025-02-06 14:37:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 14:37:06,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-02-06 14:37:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:06,779 INFO L225 Difference]: With dead ends: 230 [2025-02-06 14:37:06,779 INFO L226 Difference]: Without dead ends: 229 [2025-02-06 14:37:06,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-06 14:37:06,780 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 239 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:06,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 871 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 348 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-02-06 14:37:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-06 14:37:06,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 175. [2025-02-06 14:37:06,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.6605504587155964) internal successors, (181), 159 states have internal predecessors, (181), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:37:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 206 transitions. [2025-02-06 14:37:06,786 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 206 transitions. Word has length 28 [2025-02-06 14:37:06,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:06,786 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 206 transitions. [2025-02-06 14:37:06,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:37:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 206 transitions. [2025-02-06 14:37:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 14:37:06,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:06,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:06,795 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-06 14:37:06,994 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-06 14:37:06,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_29_to_40_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1980886600, now seen corresponding path program 1 times [2025-02-06 14:37:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:06,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927754900] [2025-02-06 14:37:06,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:07,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:37:07,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:37:07,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:07,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:37:07,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090999576] [2025-02-06 14:37:07,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:07,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:07,013 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-06 14:37:07,014 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-06 14:37:07,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:37:07,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:37:07,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:07,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:07,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 14:37:07,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:07,092 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-06 14:37:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:37:07,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:37:07,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:07,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927754900] [2025-02-06 14:37:07,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:37:07,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090999576] [2025-02-06 14:37:07,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090999576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:07,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:07,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867092462] [2025-02-06 14:37:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:07,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:07,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:07,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:07,175 INFO L87 Difference]: Start difference. First operand 175 states and 206 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:07,295 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2025-02-06 14:37:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:37:07,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-06 14:37:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:07,297 INFO L225 Difference]: With dead ends: 229 [2025-02-06 14:37:07,297 INFO L226 Difference]: Without dead ends: 228 [2025-02-06 14:37:07,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:07,298 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 178 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:07,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 518 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-06 14:37:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 175. [2025-02-06 14:37:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.651376146788991) internal successors, (180), 159 states have internal predecessors, (180), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:37:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 205 transitions. [2025-02-06 14:37:07,308 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 205 transitions. Word has length 29 [2025-02-06 14:37:07,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:07,308 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 205 transitions. [2025-02-06 14:37:07,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2025-02-06 14:37:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 14:37:07,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:07,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:07,315 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-06 14:37:07,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:07,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_29_to_40_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1277942463, now seen corresponding path program 1 times [2025-02-06 14:37:07,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:07,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152957100] [2025-02-06 14:37:07,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:07,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:37:07,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:37:07,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:07,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:37:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152957100] [2025-02-06 14:37:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152957100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:07,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:07,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570224527] [2025-02-06 14:37:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:07,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:07,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:07,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:07,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:07,622 INFO L87 Difference]: Start difference. First operand 175 states and 205 transitions. Second operand has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:07,720 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2025-02-06 14:37:07,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:07,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-02-06 14:37:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:07,721 INFO L225 Difference]: With dead ends: 212 [2025-02-06 14:37:07,721 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 14:37:07,722 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-06 14:37:07,722 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 121 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:07,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 527 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 14:37:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2025-02-06 14:37:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.6330275229357798) internal successors, (178), 159 states have internal predecessors, (178), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:37:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2025-02-06 14:37:07,728 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 30 [2025-02-06 14:37:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:07,728 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2025-02-06 14:37:07,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2025-02-06 14:37:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 14:37:07,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:07,729 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:07,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:37:07,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_29_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:07,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash -257939555, now seen corresponding path program 1 times [2025-02-06 14:37:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828185896] [2025-02-06 14:37:07,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:07,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:37:07,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:37:07,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:07,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:37:07,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313715934] [2025-02-06 14:37:07,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:07,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:07,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:07,756 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-06 14:37:07,757 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-06 14:37:07,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:37:07,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:37:07,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:07,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:07,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 14:37:07,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:07,824 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-06 14:37:07,828 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-06 14:37:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:08,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:37:08,326 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 38 treesize of output 26 [2025-02-06 14:37:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:37:08,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:08,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828185896] [2025-02-06 14:37:08,401 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:37:08,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313715934] [2025-02-06 14:37:08,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313715934] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:37:08,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 14:37:08,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2025-02-06 14:37:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760027540] [2025-02-06 14:37:08,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 14:37:08,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 14:37:08,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:08,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 14:37:08,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-02-06 14:37:08,405 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 14:37:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:09,251 INFO L93 Difference]: Finished difference Result 230 states and 239 transitions. [2025-02-06 14:37:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 14:37:09,252 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2025-02-06 14:37:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:09,253 INFO L225 Difference]: With dead ends: 230 [2025-02-06 14:37:09,253 INFO L226 Difference]: Without dead ends: 228 [2025-02-06 14:37:09,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 14:37:09,254 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 351 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:09,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1126 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 14:37:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-06 14:37:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 175. [2025-02-06 14:37:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.614678899082569) internal successors, (176), 159 states have internal predecessors, (176), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:37:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2025-02-06 14:37:09,262 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 32 [2025-02-06 14:37:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:09,262 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2025-02-06 14:37:09,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 14:37:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2025-02-06 14:37:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 14:37:09,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:09,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:09,269 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-06 14:37:09,468 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,SelfDestructingSolverStorable7 [2025-02-06 14:37:09,468 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_29_to_40_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:09,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1228190843, now seen corresponding path program 1 times [2025-02-06 14:37:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377759329] [2025-02-06 14:37:09,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:09,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 14:37:09,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 14:37:09,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:09,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:37:09,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:09,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377759329] [2025-02-06 14:37:09,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377759329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:09,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:09,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710361605] [2025-02-06 14:37:09,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:09,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:09,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:09,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:09,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:09,632 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:09,735 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2025-02-06 14:37:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:09,735 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-02-06 14:37:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:09,736 INFO L225 Difference]: With dead ends: 212 [2025-02-06 14:37:09,736 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 14:37:09,737 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-06 14:37:09,737 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 103 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:09,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 533 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 14:37:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2025-02-06 14:37:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.5963302752293578) internal successors, (174), 159 states have internal predecessors, (174), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:37:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2025-02-06 14:37:09,745 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 34 [2025-02-06 14:37:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:09,745 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2025-02-06 14:37:09,745 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2025-02-06 14:37:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 14:37:09,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:09,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:09,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:37:09,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_29_to_40_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:09,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:09,746 INFO L85 PathProgramCache]: Analyzing trace with hash -824606375, now seen corresponding path program 1 times [2025-02-06 14:37:09,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:09,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921482420] [2025-02-06 14:37:09,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:09,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 14:37:09,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 14:37:09,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:09,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:37:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921482420] [2025-02-06 14:37:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921482420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:09,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320438004] [2025-02-06 14:37:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:09,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:09,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:09,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:09,897 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:10,040 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2025-02-06 14:37:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:37:10,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-02-06 14:37:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:10,043 INFO L225 Difference]: With dead ends: 210 [2025-02-06 14:37:10,043 INFO L226 Difference]: Without dead ends: 208 [2025-02-06 14:37:10,043 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-06 14:37:10,044 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 104 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:10,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 546 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-06 14:37:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 175. [2025-02-06 14:37:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.5779816513761469) internal successors, (172), 159 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:37:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2025-02-06 14:37:10,051 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 197 transitions. Word has length 36 [2025-02-06 14:37:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:10,051 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 197 transitions. [2025-02-06 14:37:10,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 197 transitions. [2025-02-06 14:37:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 14:37:10,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:10,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:10,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:37:10,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_29_to_40_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:10,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:10,053 INFO L85 PathProgramCache]: Analyzing trace with hash 207006144, now seen corresponding path program 1 times [2025-02-06 14:37:10,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:10,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708272398] [2025-02-06 14:37:10,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:10,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 14:37:10,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 14:37:10,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:10,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:37:10,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:10,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708272398] [2025-02-06 14:37:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708272398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:10,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191325415] [2025-02-06 14:37:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:10,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:10,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:10,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:10,310 INFO L87 Difference]: Start difference. First operand 175 states and 197 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:10,648 INFO L93 Difference]: Finished difference Result 200 states and 210 transitions. [2025-02-06 14:37:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:37:10,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-02-06 14:37:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:10,649 INFO L225 Difference]: With dead ends: 200 [2025-02-06 14:37:10,649 INFO L226 Difference]: Without dead ends: 198 [2025-02-06 14:37:10,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:37:10,650 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 95 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:10,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 585 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:37:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-06 14:37:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2025-02-06 14:37:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.5596330275229358) internal successors, (170), 159 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:37:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2025-02-06 14:37:10,656 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 37 [2025-02-06 14:37:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:10,656 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2025-02-06 14:37:10,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:37:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2025-02-06 14:37:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 14:37:10,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:10,657 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:10,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:37:10,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_29_to_40_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:10,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash 814748734, now seen corresponding path program 1 times [2025-02-06 14:37:10,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:10,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244227959] [2025-02-06 14:37:10,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:10,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 14:37:10,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 14:37:10,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:10,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:37:10,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244227959] [2025-02-06 14:37:10,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244227959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:10,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:10,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:10,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382851980] [2025-02-06 14:37:10,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:10,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:10,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:10,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:10,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:10,754 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:37:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:10,820 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2025-02-06 14:37:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:10,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-02-06 14:37:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:10,822 INFO L225 Difference]: With dead ends: 185 [2025-02-06 14:37:10,822 INFO L226 Difference]: Without dead ends: 183 [2025-02-06 14:37:10,822 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-06 14:37:10,823 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:10,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 566 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:37:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-06 14:37:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2025-02-06 14:37:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 161 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:37:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2025-02-06 14:37:10,834 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 47 [2025-02-06 14:37:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:10,834 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2025-02-06 14:37:10,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:37:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2025-02-06 14:37:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 14:37:10,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:10,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:10,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:37:10,836 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_29_to_40_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1289484828, now seen corresponding path program 1 times [2025-02-06 14:37:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868912904] [2025-02-06 14:37:10,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:10,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 14:37:10,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 14:37:10,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:10,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:10,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:37:10,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:10,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868912904] [2025-02-06 14:37:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868912904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:10,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:10,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:37:10,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672417610] [2025-02-06 14:37:10,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:10,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:37:10,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:10,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:37:10,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:37:10,962 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:37:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:11,034 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2025-02-06 14:37:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:37:11,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-02-06 14:37:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:11,035 INFO L225 Difference]: With dead ends: 204 [2025-02-06 14:37:11,035 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 14:37:11,035 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-06 14:37:11,036 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 72 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:11,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 561 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 14:37:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 179. [2025-02-06 14:37:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 163 states have internal predecessors, (174), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-02-06 14:37:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 199 transitions. [2025-02-06 14:37:11,046 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 199 transitions. Word has length 49 [2025-02-06 14:37:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:11,047 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 199 transitions. [2025-02-06 14:37:11,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:37:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 199 transitions. [2025-02-06 14:37:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 14:37:11,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:11,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:11,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 14:37:11,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:11,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1319373851, now seen corresponding path program 1 times [2025-02-06 14:37:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555016139] [2025-02-06 14:37:11,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:11,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 14:37:11,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 14:37:11,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:11,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:37:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:11,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555016139] [2025-02-06 14:37:11,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555016139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:11,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:11,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:37:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401211014] [2025-02-06 14:37:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:11,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:37:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:11,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:37:11,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:37:11,126 INFO L87 Difference]: Start difference. First operand 179 states and 199 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:37:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:11,207 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2025-02-06 14:37:11,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:37:11,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-02-06 14:37:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:11,208 INFO L225 Difference]: With dead ends: 187 [2025-02-06 14:37:11,208 INFO L226 Difference]: Without dead ends: 183 [2025-02-06 14:37:11,209 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-06 14:37:11,209 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 42 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:11,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 366 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-06 14:37:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-02-06 14:37:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 114 states have (on average 1.5) internal successors, (171), 164 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-06 14:37:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2025-02-06 14:37:11,218 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 50 [2025-02-06 14:37:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:11,218 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2025-02-06 14:37:11,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:37:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2025-02-06 14:37:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 14:37:11,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:11,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:11,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:37:11,220 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:11,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:11,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2050629638, now seen corresponding path program 1 times [2025-02-06 14:37:11,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:11,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134054913] [2025-02-06 14:37:11,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:11,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:11,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 14:37:11,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 14:37:11,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:11,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:37:11,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134054913] [2025-02-06 14:37:11,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134054913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:11,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:11,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:11,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620611326] [2025-02-06 14:37:11,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:11,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:11,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:11,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:11,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:11,465 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:37:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:11,582 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2025-02-06 14:37:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:37:11,582 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-02-06 14:37:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:11,583 INFO L225 Difference]: With dead ends: 195 [2025-02-06 14:37:11,583 INFO L226 Difference]: Without dead ends: 194 [2025-02-06 14:37:11,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:11,584 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 60 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:11,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 621 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-06 14:37:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2025-02-06 14:37:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 165 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-06 14:37:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2025-02-06 14:37:11,590 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 51 [2025-02-06 14:37:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:11,590 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2025-02-06 14:37:11,591 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:37:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2025-02-06 14:37:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 14:37:11,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:11,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:11,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:37:11,591 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:11,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:11,592 INFO L85 PathProgramCache]: Analyzing trace with hash 854990633, now seen corresponding path program 1 times [2025-02-06 14:37:11,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:11,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391452084] [2025-02-06 14:37:11,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:11,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 14:37:11,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 14:37:11,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:11,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:37:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391452084] [2025-02-06 14:37:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391452084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:37:11,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:37:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:37:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454253941] [2025-02-06 14:37:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:37:11,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:37:11,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:11,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:37:11,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:37:11,811 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand has 7 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:37:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:11,926 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2025-02-06 14:37:11,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:37:11,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-02-06 14:37:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:11,927 INFO L225 Difference]: With dead ends: 195 [2025-02-06 14:37:11,927 INFO L226 Difference]: Without dead ends: 194 [2025-02-06 14:37:11,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:37:11,928 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 59 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:11,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 626 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:37:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-06 14:37:11,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 183. [2025-02-06 14:37:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 166 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-06 14:37:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2025-02-06 14:37:11,937 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 52 [2025-02-06 14:37:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:11,937 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2025-02-06 14:37:11,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:37:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2025-02-06 14:37:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 14:37:11,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:11,938 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:11,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 14:37:11,938 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_29_to_40_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:11,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2134946981, now seen corresponding path program 1 times [2025-02-06 14:37:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:11,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162239648] [2025-02-06 14:37:11,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:11,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 14:37:11,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 14:37:11,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:11,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:37:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162239648] [2025-02-06 14:37:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162239648] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542625185] [2025-02-06 14:37:12,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:12,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:12,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:12,138 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-06 14:37:12,140 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-06 14:37:12,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 14:37:12,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 14:37:12,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:12,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:12,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 14:37:12,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:12,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-02-06 14:37:12,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 14:37:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:37:12,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:37:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:37:12,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542625185] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:37:12,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:37:12,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-02-06 14:37:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880473922] [2025-02-06 14:37:12,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:37:12,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 14:37:12,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:12,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 14:37:12,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-02-06 14:37:12,564 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 17 states have internal predecessors, (119), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 14:37:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:37:12,839 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2025-02-06 14:37:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 14:37:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 17 states have internal predecessors, (119), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2025-02-06 14:37:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:37:12,841 INFO L225 Difference]: With dead ends: 188 [2025-02-06 14:37:12,841 INFO L226 Difference]: Without dead ends: 185 [2025-02-06 14:37:12,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2025-02-06 14:37:12,841 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 422 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:37:12,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1102 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:37:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-06 14:37:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2025-02-06 14:37:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 163 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-02-06 14:37:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2025-02-06 14:37:12,851 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 56 [2025-02-06 14:37:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:37:12,851 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2025-02-06 14:37:12,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 17 states have internal predecessors, (119), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 14:37:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2025-02-06 14:37:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 14:37:12,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:37:12,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:37:12,858 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-06 14:37:13,053 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,SelfDestructingSolverStorable16 [2025-02-06 14:37:13,053 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_29_to_40_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-06 14:37:13,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:37:13,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1758847004, now seen corresponding path program 1 times [2025-02-06 14:37:13,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:37:13,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938160953] [2025-02-06 14:37:13,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:37:13,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 14:37:13,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 14:37:13,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:13,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:37:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:37:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938160953] [2025-02-06 14:37:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938160953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:37:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380070064] [2025-02-06 14:37:13,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:37:13,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:37:13,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:37:13,264 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-06 14:37:13,266 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-06 14:37:13,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 14:37:13,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 14:37:13,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:37:13,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:37:13,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 14:37:13,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:37:13,468 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 23 treesize of output 15 [2025-02-06 14:37:13,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 14:37:13,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:37:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:13,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:37:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:37:13,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380070064] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:37:13,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:37:13,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 11] total 30 [2025-02-06 14:37:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937196271] [2025-02-06 14:37:13,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:37:13,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 14:37:13,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:37:13,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 14:37:13,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2025-02-06 14:37:13,939 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand has 31 states, 29 states have (on average 4.517241379310345) internal successors, (131), 27 states have internal predecessors, (131), 12 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-06 14:37:18,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:30,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:34,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:38,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:42,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:54,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:37:59,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:38:19,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:38:24,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:38:28,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 14:38:32,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]