./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu-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_cohencu-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 260777f6a7be1f16cc330a008300c11ebdea8f1cf9d8e96a0325274fd8fd5b2a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:34:11,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:34:11,817 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:34:11,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:34:11,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:34:11,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:34:11,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:34:11,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:34:11,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:34:11,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:34:11,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:34:11,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:34:11,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:34:11,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:34:11,844 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:34:11,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:34:11,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:34:11,846 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:34:11,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:34:11,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:34:11,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:34:11,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:34:11,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:34:11,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:34:11,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:34:11,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:34:11,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:34:11,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:34:11,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:34:11,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:34:11,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:34:11,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:34:11,847 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 -> 260777f6a7be1f16cc330a008300c11ebdea8f1cf9d8e96a0325274fd8fd5b2a [2025-02-06 14:34:12,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:34:12,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:34:12,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:34:12,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:34:12,120 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:34:12,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu-ll.c [2025-02-06 14:34:13,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/268803c8a/37168d2f9828435f824990825d43fc08/FLAGa883b0c02 [2025-02-06 14:34:13,532 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:34:13,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu-ll.c [2025-02-06 14:34:13,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/268803c8a/37168d2f9828435f824990825d43fc08/FLAGa883b0c02 [2025-02-06 14:34:13,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/268803c8a/37168d2f9828435f824990825d43fc08 [2025-02-06 14:34:13,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:34:13,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:34:13,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:34:13,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:34:13,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:34:13,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:34:13" (1/1) ... [2025-02-06 14:34:13,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad399b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:13, skipping insertion in model container [2025-02-06 14:34:13,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:34:13" (1/1) ... [2025-02-06 14:34:13,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:34:13,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:34:13,988 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:34:14,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:34:14,017 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:34:14,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14 WrapperNode [2025-02-06 14:34:14,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:34:14,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:34:14,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:34:14,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:34:14,023 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:34:14" (1/1) ... [2025-02-06 14:34:14,027 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:34:14" (1/1) ... [2025-02-06 14:34:14,048 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2025-02-06 14:34:14,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:34:14,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:34:14,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:34:14,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:34:14,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,067 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 5, 12, 21, 15, 11]. 32 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 1, 2, 2, 2, 2]. [2025-02-06 14:34:14,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:34:14,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:34:14,083 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:34:14,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:34:14,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (1/1) ... [2025-02-06 14:34:14,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:34:14,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:14,118 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:34:14,129 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:34:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 14:34:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_29_to_41_0 [2025-02-06 14:34:14,146 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_29_to_41_0 [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:34:14,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:34:14,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:34:14,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 14:34:14,232 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:34:14,233 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:34:14,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#z~0#1.base, main_~#z~0#1.offset);havoc main_~#z~0#1.base, main_~#z~0#1.offset; [2025-02-06 14:34:14,905 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2025-02-06 14:34:14,905 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:34:14,922 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:34:14,922 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:34:14,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:34:14 BoogieIcfgContainer [2025-02-06 14:34:14,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:34:14,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:34:14,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:34:14,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:34:14,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:34:13" (1/3) ... [2025-02-06 14:34:14,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f458820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:34:14, skipping insertion in model container [2025-02-06 14:34:14,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:14" (2/3) ... [2025-02-06 14:34:14,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f458820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:34:14, skipping insertion in model container [2025-02-06 14:34:14,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:34:14" (3/3) ... [2025-02-06 14:34:14,931 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_cohencu-ll.c [2025-02-06 14:34:14,942 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:34:14,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_cohencu-ll.c that has 3 procedures, 317 locations, 1 initial locations, 0 loop locations, and 138 error locations. [2025-02-06 14:34:14,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:34:15,003 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;@49caffa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:34:15,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-02-06 14:34:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 14:34:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:34:15,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:15,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:34:15,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_29_to_41_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1557033859, now seen corresponding path program 1 times [2025-02-06 14:34:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899709357] [2025-02-06 14:34:15,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:15,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:34:15,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:34:15,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:15,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:15,464 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:34:15,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:15,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899709357] [2025-02-06 14:34:15,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899709357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:15,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:15,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948145240] [2025-02-06 14:34:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:15,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:15,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:15,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:15,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:15,486 INFO L87 Difference]: Start difference. First operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 4 states have (on average 1.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:34:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:15,699 INFO L93 Difference]: Finished difference Result 738 states and 792 transitions. [2025-02-06 14:34:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:15,701 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:34:15,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:15,711 INFO L225 Difference]: With dead ends: 738 [2025-02-06 14:34:15,711 INFO L226 Difference]: Without dead ends: 418 [2025-02-06 14:34:15,714 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:34:15,716 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 205 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:15,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1530 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-06 14:34:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 371. [2025-02-06 14:34:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8497652582159625) internal successors, (394), 351 states have internal predecessors, (394), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 429 transitions. [2025-02-06 14:34:15,777 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 429 transitions. Word has length 6 [2025-02-06 14:34:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:15,777 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 429 transitions. [2025-02-06 14:34:15,777 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:34:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 429 transitions. [2025-02-06 14:34:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 14:34:15,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:15,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:34:15,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:34:15,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_29_to_41_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:15,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 527372962, now seen corresponding path program 1 times [2025-02-06 14:34:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:15,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158284533] [2025-02-06 14:34:15,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:15,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:15,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:34:15,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:34:15,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:15,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:15,979 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:34:15,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:15,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158284533] [2025-02-06 14:34:15,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158284533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:15,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:15,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:15,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265793881] [2025-02-06 14:34:15,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:15,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:15,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:15,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:15,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:15,982 INFO L87 Difference]: Start difference. First operand 371 states and 429 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:34:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:16,170 INFO L93 Difference]: Finished difference Result 418 states and 434 transitions. [2025-02-06 14:34:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:16,171 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:34:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:16,172 INFO L225 Difference]: With dead ends: 418 [2025-02-06 14:34:16,172 INFO L226 Difference]: Without dead ends: 414 [2025-02-06 14:34:16,173 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:34:16,173 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 200 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:16,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1479 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-06 14:34:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 371. [2025-02-06 14:34:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8309859154929577) internal successors, (390), 351 states have internal predecessors, (390), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 425 transitions. [2025-02-06 14:34:16,185 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 425 transitions. Word has length 16 [2025-02-06 14:34:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:16,185 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 425 transitions. [2025-02-06 14:34:16,185 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:34:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 425 transitions. [2025-02-06 14:34:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 14:34:16,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:16,186 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:34:16,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:34:16,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_29_to_41_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:16,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash -693762722, now seen corresponding path program 1 times [2025-02-06 14:34:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:16,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246901164] [2025-02-06 14:34:16,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:16,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 14:34:16,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 14:34:16,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:16,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:16,315 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:34:16,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:16,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246901164] [2025-02-06 14:34:16,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246901164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:16,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:16,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:16,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154569193] [2025-02-06 14:34:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:16,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:16,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:16,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:16,316 INFO L87 Difference]: Start difference. First operand 371 states and 425 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 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:34:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:16,432 INFO L93 Difference]: Finished difference Result 414 states and 430 transitions. [2025-02-06 14:34:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:16,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 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:34:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:16,434 INFO L225 Difference]: With dead ends: 414 [2025-02-06 14:34:16,434 INFO L226 Difference]: Without dead ends: 412 [2025-02-06 14:34:16,435 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:34:16,435 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 186 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:16,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1481 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-06 14:34:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 371. [2025-02-06 14:34:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8215962441314555) internal successors, (388), 351 states have internal predecessors, (388), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2025-02-06 14:34:16,446 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 20 [2025-02-06 14:34:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:16,446 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2025-02-06 14:34:16,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 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:34:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2025-02-06 14:34:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 14:34:16,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:16,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:16,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:34:16,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_29_to_41_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:16,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash -986042692, now seen corresponding path program 1 times [2025-02-06 14:34:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:16,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429142277] [2025-02-06 14:34:16,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:16,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 14:34:16,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 14:34:16,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:16,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:16,631 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:34:16,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:16,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429142277] [2025-02-06 14:34:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429142277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:16,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618559071] [2025-02-06 14:34:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:16,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:16,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:16,633 INFO L87 Difference]: Start difference. First operand 371 states and 423 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:16,815 INFO L93 Difference]: Finished difference Result 412 states and 428 transitions. [2025-02-06 14:34:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:16,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 14:34:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:16,817 INFO L225 Difference]: With dead ends: 412 [2025-02-06 14:34:16,817 INFO L226 Difference]: Without dead ends: 410 [2025-02-06 14:34:16,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:34:16,817 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 188 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:16,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1549 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-02-06 14:34:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 371. [2025-02-06 14:34:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.812206572769953) internal successors, (386), 351 states have internal predecessors, (386), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 421 transitions. [2025-02-06 14:34:16,829 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 421 transitions. Word has length 22 [2025-02-06 14:34:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:16,829 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 421 transitions. [2025-02-06 14:34:16,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 421 transitions. [2025-02-06 14:34:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 14:34:16,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:16,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:16,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:34:16,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_29_to_41_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:16,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:16,831 INFO L85 PathProgramCache]: Analyzing trace with hash -502552313, now seen corresponding path program 1 times [2025-02-06 14:34:16,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:16,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110629481] [2025-02-06 14:34:16,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:16,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 14:34:16,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 14:34:16,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:16,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:16,938 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:34:16,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110629481] [2025-02-06 14:34:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110629481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:16,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272254521] [2025-02-06 14:34:16,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:16,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:16,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:16,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:16,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:16,939 INFO L87 Difference]: Start difference. First operand 371 states and 421 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:34:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:17,078 INFO L93 Difference]: Finished difference Result 410 states and 426 transitions. [2025-02-06 14:34:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 23 [2025-02-06 14:34:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:17,082 INFO L225 Difference]: With dead ends: 410 [2025-02-06 14:34:17,082 INFO L226 Difference]: Without dead ends: 408 [2025-02-06 14:34:17,083 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:34:17,083 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 175 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:17,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1483 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-06 14:34:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 371. [2025-02-06 14:34:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8028169014084507) internal successors, (384), 351 states have internal predecessors, (384), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 419 transitions. [2025-02-06 14:34:17,104 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 419 transitions. Word has length 23 [2025-02-06 14:34:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:17,104 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 419 transitions. [2025-02-06 14:34:17,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:34:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 419 transitions. [2025-02-06 14:34:17,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 14:34:17,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:17,105 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:34:17,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:34:17,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_29_to_41_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:17,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1614887917, now seen corresponding path program 1 times [2025-02-06 14:34:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:17,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249870831] [2025-02-06 14:34:17,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:17,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:34:17,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:34:17,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:17,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:17,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559120411] [2025-02-06 14:34:17,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:17,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:17,155 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:34:17,157 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:34:17,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:34:17,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:34:17,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:17,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:17,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 14:34:17,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:17,263 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:34:17,414 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:34:17,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:17,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:17,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249870831] [2025-02-06 14:34:17,415 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:17,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559120411] [2025-02-06 14:34:17,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559120411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:17,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:17,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251910186] [2025-02-06 14:34:17,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:17,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:17,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:17,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:17,416 INFO L87 Difference]: Start difference. First operand 371 states and 419 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:34:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:17,598 INFO L93 Difference]: Finished difference Result 590 states and 609 transitions. [2025-02-06 14:34:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:17,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 32 [2025-02-06 14:34:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:17,601 INFO L225 Difference]: With dead ends: 590 [2025-02-06 14:34:17,601 INFO L226 Difference]: Without dead ends: 586 [2025-02-06 14:34:17,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:34:17,602 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 344 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:17,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1768 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-06 14:34:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 453. [2025-02-06 14:34:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8131487889273357) internal successors, (524), 427 states have internal predecessors, (524), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2025-02-06 14:34:17,612 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 32 [2025-02-06 14:34:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:17,612 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2025-02-06 14:34:17,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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:34:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2025-02-06 14:34:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 14:34:17,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:17,613 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:17,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:17,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:17,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_29_to_41_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:17,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1832861348, now seen corresponding path program 1 times [2025-02-06 14:34:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:17,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279965529] [2025-02-06 14:34:17,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:17,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:17,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 14:34:17,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 14:34:17,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:17,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:17,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204864504] [2025-02-06 14:34:17,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:17,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:17,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:17,847 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:34:17,849 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:34:17,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 14:34:17,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 14:34:17,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:17,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:17,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 14:34:17,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:17,940 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:34:17,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:34:17,992 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:34:18,411 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:34:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:34:18,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:18,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279965529] [2025-02-06 14:34:18,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204864504] [2025-02-06 14:34:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204864504] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:18,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:18,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-02-06 14:34:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475463289] [2025-02-06 14:34:18,513 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:18,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 14:34:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:18,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 14:34:18,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 14:34:18,514 INFO L87 Difference]: Start difference. First operand 453 states and 569 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:34:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:19,265 INFO L93 Difference]: Finished difference Result 594 states and 613 transitions. [2025-02-06 14:34:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 14:34:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-02-06 14:34:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:19,268 INFO L225 Difference]: With dead ends: 594 [2025-02-06 14:34:19,268 INFO L226 Difference]: Without dead ends: 593 [2025-02-06 14:34:19,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-02-06 14:34:19,269 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 449 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:19,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 2866 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 14:34:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-06 14:34:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 453. [2025-02-06 14:34:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8096885813148789) internal successors, (523), 427 states have internal predecessors, (523), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 568 transitions. [2025-02-06 14:34:19,288 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 568 transitions. Word has length 42 [2025-02-06 14:34:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:19,288 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 568 transitions. [2025-02-06 14:34:19,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:34:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 568 transitions. [2025-02-06 14:34:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 14:34:19,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:19,289 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:19,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:19,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:19,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_29_to_41_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:19,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:19,494 INFO L85 PathProgramCache]: Analyzing trace with hash 984126987, now seen corresponding path program 1 times [2025-02-06 14:34:19,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:19,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997824926] [2025-02-06 14:34:19,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:19,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:19,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:34:19,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:34:19,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:19,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:19,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992828933] [2025-02-06 14:34:19,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:19,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:19,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:19,518 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:34:19,519 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:34:19,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:34:19,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:34:19,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:19,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:19,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 14:34:19,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:19,607 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:34:19,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:34:19,645 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:34:20,303 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 45 treesize of output 29 [2025-02-06 14:34:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:34:20,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:20,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997824926] [2025-02-06 14:34:20,499 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992828933] [2025-02-06 14:34:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992828933] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:20,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-02-06 14:34:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830125170] [2025-02-06 14:34:20,499 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:20,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 14:34:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:20,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 14:34:20,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:20,501 INFO L87 Difference]: Start difference. First operand 453 states and 568 transitions. Second operand has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:34:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:21,592 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2025-02-06 14:34:21,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 14:34:21,593 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-02-06 14:34:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:21,595 INFO L225 Difference]: With dead ends: 593 [2025-02-06 14:34:21,595 INFO L226 Difference]: Without dead ends: 592 [2025-02-06 14:34:21,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-02-06 14:34:21,596 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 516 mSDsluCounter, 2508 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:21,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2762 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 14:34:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-06 14:34:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 453. [2025-02-06 14:34:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.806228373702422) internal successors, (522), 427 states have internal predecessors, (522), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 567 transitions. [2025-02-06 14:34:21,614 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 567 transitions. Word has length 43 [2025-02-06 14:34:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:21,614 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 567 transitions. [2025-02-06 14:34:21,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:34:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 567 transitions. [2025-02-06 14:34:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 14:34:21,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:21,617 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] [2025-02-06 14:34:21,624 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:34:21,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:21,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_29_to_41_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:21,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:21,818 INFO L85 PathProgramCache]: Analyzing trace with hash 443165570, now seen corresponding path program 1 times [2025-02-06 14:34:21,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:21,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677110664] [2025-02-06 14:34:21,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:21,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 14:34:21,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 14:34:21,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:21,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:21,980 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:34:21,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677110664] [2025-02-06 14:34:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677110664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:21,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:21,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:21,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486754992] [2025-02-06 14:34:21,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:21,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:21,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:21,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:21,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:21,981 INFO L87 Difference]: Start difference. First operand 453 states and 567 transitions. Second operand has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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:34:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:22,145 INFO L93 Difference]: Finished difference Result 560 states and 580 transitions. [2025-02-06 14:34:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:22,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 44 [2025-02-06 14:34:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:22,148 INFO L225 Difference]: With dead ends: 560 [2025-02-06 14:34:22,148 INFO L226 Difference]: Without dead ends: 558 [2025-02-06 14:34:22,148 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:34:22,148 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 313 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:22,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1431 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:22,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-02-06 14:34:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 453. [2025-02-06 14:34:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7993079584775087) internal successors, (520), 427 states have internal predecessors, (520), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 565 transitions. [2025-02-06 14:34:22,161 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 565 transitions. Word has length 44 [2025-02-06 14:34:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:22,161 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 565 transitions. [2025-02-06 14:34:22,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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:34:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 565 transitions. [2025-02-06 14:34:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 14:34:22,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:22,162 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:22,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:34:22,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_29_to_41_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:22,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash 680351840, now seen corresponding path program 1 times [2025-02-06 14:34:22,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:22,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922700789] [2025-02-06 14:34:22,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:22,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:22,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 14:34:22,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 14:34:22,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:22,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:22,325 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:34:22,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:22,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922700789] [2025-02-06 14:34:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922700789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:22,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:22,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510481483] [2025-02-06 14:34:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:22,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:22,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:22,326 INFO L87 Difference]: Start difference. First operand 453 states and 565 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:22,535 INFO L93 Difference]: Finished difference Result 558 states and 578 transitions. [2025-02-06 14:34:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-02-06 14:34:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:22,538 INFO L225 Difference]: With dead ends: 558 [2025-02-06 14:34:22,538 INFO L226 Difference]: Without dead ends: 557 [2025-02-06 14:34:22,538 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:34:22,539 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 328 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:22,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1483 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-06 14:34:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 453. [2025-02-06 14:34:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7958477508650519) internal successors, (519), 427 states have internal predecessors, (519), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 564 transitions. [2025-02-06 14:34:22,554 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 564 transitions. Word has length 46 [2025-02-06 14:34:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:22,554 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 564 transitions. [2025-02-06 14:34:22,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 564 transitions. [2025-02-06 14:34:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 14:34:22,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:22,555 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:34:22,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:34:22,555 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_29_to_41_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:22,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:22,557 INFO L85 PathProgramCache]: Analyzing trace with hash -383929401, now seen corresponding path program 1 times [2025-02-06 14:34:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114407958] [2025-02-06 14:34:22,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:22,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 14:34:22,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 14:34:22,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:22,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:22,704 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:34:22,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:22,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114407958] [2025-02-06 14:34:22,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114407958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:22,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:22,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:22,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538131142] [2025-02-06 14:34:22,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:22,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:22,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:22,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:22,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:22,705 INFO L87 Difference]: Start difference. First operand 453 states and 564 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:34:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:22,946 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2025-02-06 14:34:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:22,946 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:34:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:22,948 INFO L225 Difference]: With dead ends: 557 [2025-02-06 14:34:22,948 INFO L226 Difference]: Without dead ends: 556 [2025-02-06 14:34:22,949 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:34:22,949 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 306 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:22,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-02-06 14:34:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2025-02-06 14:34:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.792387543252595) internal successors, (518), 427 states have internal predecessors, (518), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 563 transitions. [2025-02-06 14:34:22,974 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 563 transitions. Word has length 47 [2025-02-06 14:34:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:22,975 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 563 transitions. [2025-02-06 14:34:22,975 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:34:22,975 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 563 transitions. [2025-02-06 14:34:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 14:34:22,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:22,977 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] [2025-02-06 14:34:22,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:34:22,977 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_29_to_41_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:22,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 983090494, now seen corresponding path program 1 times [2025-02-06 14:34:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:22,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219574856] [2025-02-06 14:34:22,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:22,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 14:34:22,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 14:34:22,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:22,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:23,088 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:34:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219574856] [2025-02-06 14:34:23,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219574856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:23,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:23,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:23,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963325749] [2025-02-06 14:34:23,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:23,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:23,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:23,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:23,089 INFO L87 Difference]: Start difference. First operand 453 states and 563 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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:34:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:23,248 INFO L93 Difference]: Finished difference Result 568 states and 588 transitions. [2025-02-06 14:34:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 48 [2025-02-06 14:34:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:23,250 INFO L225 Difference]: With dead ends: 568 [2025-02-06 14:34:23,250 INFO L226 Difference]: Without dead ends: 566 [2025-02-06 14:34:23,250 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:34:23,251 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 311 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:23,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1423 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-06 14:34:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2025-02-06 14:34:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7854671280276817) internal successors, (516), 427 states have internal predecessors, (516), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 561 transitions. [2025-02-06 14:34:23,267 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 561 transitions. Word has length 48 [2025-02-06 14:34:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:23,267 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 561 transitions. [2025-02-06 14:34:23,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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:34:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 561 transitions. [2025-02-06 14:34:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 14:34:23,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:23,268 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:34:23,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:34:23,268 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_29_to_41_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:23,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:23,269 INFO L85 PathProgramCache]: Analyzing trace with hash -142839268, now seen corresponding path program 1 times [2025-02-06 14:34:23,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:23,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33329241] [2025-02-06 14:34:23,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:23,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:23,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 14:34:23,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 14:34:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:23,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607025147] [2025-02-06 14:34:23,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:23,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:23,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:23,288 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:34:23,296 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:34:23,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 14:34:23,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 14:34:23,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:23,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:23,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 14:34:23,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:23,369 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:34:23,372 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:34:23,374 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:34:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:34:23,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:24,271 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 46 treesize of output 38 [2025-02-06 14:34:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:34:24,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:24,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33329241] [2025-02-06 14:34:24,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:24,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607025147] [2025-02-06 14:34:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607025147] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:24,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 14:34:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2025-02-06 14:34:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672847989] [2025-02-06 14:34:24,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:24,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:34:24,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:24,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:34:24,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:34:24,364 INFO L87 Difference]: Start difference. First operand 453 states and 561 transitions. Second operand has 24 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 14:34:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:26,071 INFO L93 Difference]: Finished difference Result 582 states and 601 transitions. [2025-02-06 14:34:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 14:34:26,071 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2025-02-06 14:34:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:26,073 INFO L225 Difference]: With dead ends: 582 [2025-02-06 14:34:26,074 INFO L226 Difference]: Without dead ends: 580 [2025-02-06 14:34:26,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 14:34:26,075 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 698 mSDsluCounter, 4153 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 4402 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:26,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 4402 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 14:34:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-06 14:34:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 453. [2025-02-06 14:34:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.778546712802768) internal successors, (514), 427 states have internal predecessors, (514), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 559 transitions. [2025-02-06 14:34:26,093 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 559 transitions. Word has length 50 [2025-02-06 14:34:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:26,094 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 559 transitions. [2025-02-06 14:34:26,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 14:34:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 559 transitions. [2025-02-06 14:34:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 14:34:26,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:26,095 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:34:26,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:34:26,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 14:34:26,295 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_29_to_41_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:26,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash 170417914, now seen corresponding path program 1 times [2025-02-06 14:34:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117046052] [2025-02-06 14:34:26,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:26,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 14:34:26,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 14:34:26,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:26,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:26,409 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:34:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117046052] [2025-02-06 14:34:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117046052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:26,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:26,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343367420] [2025-02-06 14:34:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:26,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:26,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:26,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:26,411 INFO L87 Difference]: Start difference. First operand 453 states and 559 transitions. Second operand has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 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:34:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:26,563 INFO L93 Difference]: Finished difference Result 576 states and 596 transitions. [2025-02-06 14:34:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:26,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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:34:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:26,565 INFO L225 Difference]: With dead ends: 576 [2025-02-06 14:34:26,566 INFO L226 Difference]: Without dead ends: 574 [2025-02-06 14:34:26,566 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:34:26,568 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 309 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:26,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1416 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-02-06 14:34:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 453. [2025-02-06 14:34:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7716262975778547) internal successors, (512), 427 states have internal predecessors, (512), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 557 transitions. [2025-02-06 14:34:26,584 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 557 transitions. Word has length 52 [2025-02-06 14:34:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:26,584 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 557 transitions. [2025-02-06 14:34:26,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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:34:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 557 transitions. [2025-02-06 14:34:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 14:34:26,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:26,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:26,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:34:26,585 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_29_to_41_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:26,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash 562858968, now seen corresponding path program 1 times [2025-02-06 14:34:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:26,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665994654] [2025-02-06 14:34:26,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:26,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 14:34:26,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 14:34:26,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:26,734 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:34:26,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:26,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665994654] [2025-02-06 14:34:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665994654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:26,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:26,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:26,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939972531] [2025-02-06 14:34:26,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:26,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:26,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:26,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:26,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:26,736 INFO L87 Difference]: Start difference. First operand 453 states and 557 transitions. Second operand has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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:34:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:26,968 INFO L93 Difference]: Finished difference Result 574 states and 594 transitions. [2025-02-06 14:34:26,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:26,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 54 [2025-02-06 14:34:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:26,970 INFO L225 Difference]: With dead ends: 574 [2025-02-06 14:34:26,970 INFO L226 Difference]: Without dead ends: 572 [2025-02-06 14:34:26,971 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:34:26,971 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 303 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:26,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1653 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-06 14:34:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2025-02-06 14:34:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7647058823529411) internal successors, (510), 427 states have internal predecessors, (510), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 555 transitions. [2025-02-06 14:34:26,988 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 555 transitions. Word has length 54 [2025-02-06 14:34:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:26,988 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 555 transitions. [2025-02-06 14:34:26,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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:34:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 555 transitions. [2025-02-06 14:34:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 14:34:26,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:26,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:26,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:34:26,989 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_29_to_41_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:26,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash 268758847, now seen corresponding path program 1 times [2025-02-06 14:34:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:26,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671774245] [2025-02-06 14:34:26,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:26,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:26,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 14:34:27,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 14:34:27,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:27,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat