./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 179ef0051cd9d26bcc80fffb98e92972213fce9443d8e4c52f2d2f0c39f6f4cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:33:19,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:33:19,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:33:19,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:33:19,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:33:19,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:33:19,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:33:19,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:33:19,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:33:19,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:33:19,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:33:19,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:33:19,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:33:19,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:33:19,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:33:19,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:33:19,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:33:19,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:33:19,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:33:19,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:33:19,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:33:19,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:33:19,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:33:19,177 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:33:19,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:33:19,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:33:19,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:33:19,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:33:19,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:33:19,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:33:19,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:33:19,180 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 179ef0051cd9d26bcc80fffb98e92972213fce9443d8e4c52f2d2f0c39f6f4cf [2025-03-04 11:33:19,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:33:19,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:33:19,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:33:19,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:33:19,375 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:33:19,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2.c [2025-03-04 11:33:20,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529a87726/9922ef0d59244353998456ece9235038/FLAG400096db7 [2025-03-04 11:33:20,663 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:33:20,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps2.c [2025-03-04 11:33:20,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529a87726/9922ef0d59244353998456ece9235038/FLAG400096db7 [2025-03-04 11:33:20,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529a87726/9922ef0d59244353998456ece9235038 [2025-03-04 11:33:20,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:33:20,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:33:20,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:33:20,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:33:20,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:33:20,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20, skipping insertion in model container [2025-03-04 11:33:20,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:33:20,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:33:20,871 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:33:20,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:33:20,902 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:33:20,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20 WrapperNode [2025-03-04 11:33:20,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:33:20,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:33:20,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:33:20,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:33:20,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,926 INFO L138 Inliner]: procedures = 16, calls = 51, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-03-04 11:33:20,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:33:20,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:33:20,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:33:20,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:33:20,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,956 INFO L175 MemorySlicer]: Split 29 memory accesses to 6 slices as follows [2, 5, 6, 10, 2, 4]. 34 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 0, 6, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 2, 1, 2]. [2025-03-04 11:33:20,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,966 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:33:20,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:33:20,970 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:33:20,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:33:20,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (1/1) ... [2025-03-04 11:33:20,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:33:20,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:20,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:33:20,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:33:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_33_0 [2025-03-04 11:33:21,018 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_33_0 [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:33:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:33:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:33:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:33:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:33:21,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:33:21,093 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:33:21,095 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:33:21,290 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#k~0#1.base, main_~#k~0#1.offset);havoc main_~#k~0#1.base, main_~#k~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-04 11:33:21,312 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-04 11:33:21,313 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:33:21,319 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:33:21,320 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:33:21,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:33:21 BoogieIcfgContainer [2025-03-04 11:33:21,320 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:33:21,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:33:21,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:33:21,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:33:21,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:33:20" (1/3) ... [2025-03-04 11:33:21,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6d5915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:33:21, skipping insertion in model container [2025-03-04 11:33:21,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:20" (2/3) ... [2025-03-04 11:33:21,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6d5915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:33:21, skipping insertion in model container [2025-03-04 11:33:21,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:33:21" (3/3) ... [2025-03-04 11:33:21,327 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps2.c [2025-03-04 11:33:21,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:33:21,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps2.c that has 3 procedures, 67 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-04 11:33:21,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:33:21,387 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;@69b1829f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:33:21,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 11:33:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:33:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:33:21,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:21,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:33:21,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_25_to_33_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:21,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1544238217, now seen corresponding path program 1 times [2025-03-04 11:33:21,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:21,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110295560] [2025-03-04 11:33:21,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:21,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:21,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:33:21,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:33:21,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:21,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437693658] [2025-03-04 11:33:21,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:21,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:21,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:21,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:21,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:33:21,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:33:21,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:33:21,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:21,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:21,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:33:21,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:21,608 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-03-04 11:33:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:21,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110295560] [2025-03-04 11:33:21,665 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437693658] [2025-03-04 11:33:21,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437693658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:21,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:21,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639246296] [2025-03-04 11:33:21,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:21,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:21,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:21,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:21,684 INFO L87 Difference]: Start difference. First operand has 67 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.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-03-04 11:33:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:21,846 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2025-03-04 11:33:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:21,848 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-03-04 11:33:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:21,853 INFO L225 Difference]: With dead ends: 172 [2025-03-04 11:33:21,854 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 11:33:21,857 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-03-04 11:33:21,860 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 75 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:21,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 257 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 11:33:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2025-03-04 11:33:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 68 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-03-04 11:33:21,895 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 6 [2025-03-04 11:33:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:21,896 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-03-04 11:33:21,897 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-03-04 11:33:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-03-04 11:33:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:33:21,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:21,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:21,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:33:22,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:33:22,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_33_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:22,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2045757909, now seen corresponding path program 1 times [2025-03-04 11:33:22,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:22,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927020686] [2025-03-04 11:33:22,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:22,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:33:22,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:33:22,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:22,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:22,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:22,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927020686] [2025-03-04 11:33:22,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927020686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:22,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:22,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:22,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264670910] [2025-03-04 11:33:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:22,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:22,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:22,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:22,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:22,382 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-03-04 11:33:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:22,499 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2025-03-04 11:33:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 8 [2025-03-04 11:33:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:22,501 INFO L225 Difference]: With dead ends: 98 [2025-03-04 11:33:22,502 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 11:33:22,502 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-03-04 11:33:22,503 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 65 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:22,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 231 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 11:33:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2025-03-04 11:33:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 68 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-03-04 11:33:22,511 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 8 [2025-03-04 11:33:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:22,511 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-03-04 11:33:22,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-03-04 11:33:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-03-04 11:33:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 11:33:22,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:22,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:22,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:33:22,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_33_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:22,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1121671117, now seen corresponding path program 1 times [2025-03-04 11:33:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068500324] [2025-03-04 11:33:22,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:22,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:33:22,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:33:22,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:22,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:22,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068500324] [2025-03-04 11:33:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068500324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:22,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360714257] [2025-03-04 11:33:22,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:22,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:22,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:22,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:22,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:22,701 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:22,843 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-03-04 11:33:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:22,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 11:33:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:22,844 INFO L225 Difference]: With dead ends: 96 [2025-03-04 11:33:22,844 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 11:33:22,844 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-03-04 11:33:22,845 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:22,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 240 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 11:33:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2025-03-04 11:33:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.565217391304348) internal successors, (72), 68 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-03-04 11:33:22,857 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 10 [2025-03-04 11:33:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:22,857 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-03-04 11:33:22,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-03-04 11:33:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 11:33:22,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:22,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:22,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:33:22,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_33_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:22,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash -412066266, now seen corresponding path program 1 times [2025-03-04 11:33:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:22,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163616104] [2025-03-04 11:33:22,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:22,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:22,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:33:22,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:33:22,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:22,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163616104] [2025-03-04 11:33:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163616104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:22,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915212279] [2025-03-04 11:33:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:22,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:22,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:22,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:22,983 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:23,101 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2025-03-04 11:33:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:23,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 11:33:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:23,102 INFO L225 Difference]: With dead ends: 95 [2025-03-04 11:33:23,102 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 11:33:23,102 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-03-04 11:33:23,102 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 58 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:23,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 231 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 11:33:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2025-03-04 11:33:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 68 states have internal predecessors, (71), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-03-04 11:33:23,113 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 11 [2025-03-04 11:33:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-03-04 11:33:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-03-04 11:33:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 11:33:23,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:23,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:23,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:33:23,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_33_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash 110847633, now seen corresponding path program 1 times [2025-03-04 11:33:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:23,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-03-04 11:33:23,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:23,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:33:23,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:33:23,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:23,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-03-04 11:33:23,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595045774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:23,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:23,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212862446] [2025-03-04 11:33:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:23,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:23,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:23,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:23,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:23,242 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:23,366 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2025-03-04 11:33:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 11:33:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:23,369 INFO L225 Difference]: With dead ends: 98 [2025-03-04 11:33:23,369 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 11:33:23,369 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-03-04 11:33:23,370 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:23,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 266 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 11:33:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2025-03-04 11:33:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 68 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2025-03-04 11:33:23,380 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 12 [2025-03-04 11:33:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:23,381 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2025-03-04 11:33:23,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2025-03-04 11:33:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 11:33:23,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:23,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:23,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:33:23,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_33_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash -858690684, now seen corresponding path program 1 times [2025-03-04 11:33:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:23,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716742179] [2025-03-04 11:33:23,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:23,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 11:33:23,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 11:33:23,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:23,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:23,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716742179] [2025-03-04 11:33:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716742179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943777821] [2025-03-04 11:33:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:23,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:23,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:23,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:23,575 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-03-04 11:33:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:23,753 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2025-03-04 11:33:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2025-03-04 11:33:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:23,754 INFO L225 Difference]: With dead ends: 89 [2025-03-04 11:33:23,754 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 11:33:23,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:23,755 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:23,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 251 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 11:33:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2025-03-04 11:33:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5) internal successors, (69), 68 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2025-03-04 11:33:23,762 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 13 [2025-03-04 11:33:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:23,762 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2025-03-04 11:33:23,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-03-04 11:33:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2025-03-04 11:33:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 11:33:23,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:23,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:33:23,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_25_to_33_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1048893796, now seen corresponding path program 1 times [2025-03-04 11:33:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872027534] [2025-03-04 11:33:23,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:23,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 11:33:23,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 11:33:23,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:23,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872027534] [2025-03-04 11:33:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872027534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:23,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025987761] [2025-03-04 11:33:23,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:23,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:23,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:23,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:23,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:23,920 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:23,985 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2025-03-04 11:33:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:23,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 11:33:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:23,986 INFO L225 Difference]: With dead ends: 96 [2025-03-04 11:33:23,986 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 11:33:23,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:23,987 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 38 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:23,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 269 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:33:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 11:33:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 76. [2025-03-04 11:33:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 69 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-03-04 11:33:23,996 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 21 [2025-03-04 11:33:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:23,996 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-03-04 11:33:23,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-03-04 11:33:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 11:33:23,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:23,997 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-03-04 11:33:23,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:33:23,997 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_25_to_33_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:23,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1844030713, now seen corresponding path program 1 times [2025-03-04 11:33:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203482575] [2025-03-04 11:33:23,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:24,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 11:33:24,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 11:33:24,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:24,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:24,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:24,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203482575] [2025-03-04 11:33:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203482575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:24,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:24,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000231733] [2025-03-04 11:33:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:24,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:24,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:24,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:24,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:24,132 INFO L87 Difference]: Start difference. First operand 76 states and 79 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-03-04 11:33:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:24,188 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2025-03-04 11:33:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:24,189 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-03-04 11:33:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:24,189 INFO L225 Difference]: With dead ends: 95 [2025-03-04 11:33:24,189 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 11:33:24,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:24,190 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:24,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 311 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:33:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 11:33:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2025-03-04 11:33:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 70 states have internal predecessors, (71), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-03-04 11:33:24,194 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 22 [2025-03-04 11:33:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:24,194 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-03-04 11:33:24,194 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-03-04 11:33:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-03-04 11:33:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:33:24,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:24,195 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-03-04 11:33:24,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:33:24,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_33_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:24,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1330377278, now seen corresponding path program 1 times [2025-03-04 11:33:24,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:24,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654695284] [2025-03-04 11:33:24,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:24,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:24,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:33:24,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:33:24,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:24,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:24,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654695284] [2025-03-04 11:33:24,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654695284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:24,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:24,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:24,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667479736] [2025-03-04 11:33:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:24,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:24,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:24,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:24,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:24,333 INFO L87 Difference]: Start difference. First operand 77 states and 80 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-03-04 11:33:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:24,388 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2025-03-04 11:33:24,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:24,388 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-03-04 11:33:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:24,389 INFO L225 Difference]: With dead ends: 94 [2025-03-04 11:33:24,389 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 11:33:24,389 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-03-04 11:33:24,389 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 34 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:24,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 249 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:33:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 11:33:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2025-03-04 11:33:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.46) internal successors, (73), 72 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-03-04 11:33:24,394 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 23 [2025-03-04 11:33:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:24,394 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-03-04 11:33:24,394 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-03-04 11:33:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-03-04 11:33:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:33:24,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:24,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:24,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:33:24,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:24,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1707002637, now seen corresponding path program 1 times [2025-03-04 11:33:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:24,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852836769] [2025-03-04 11:33:24,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:24,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:24,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:33:24,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:33:24,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:24,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:24,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634049886] [2025-03-04 11:33:24,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:24,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:24,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:24,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:24,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:33:24,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:33:24,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:33:24,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:24,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:24,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:33:24,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:24,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:33:24,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 11:33:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:24,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852836769] [2025-03-04 11:33:24,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634049886] [2025-03-04 11:33:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634049886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:33:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098414653] [2025-03-04 11:33:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:24,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:33:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:24,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:33:24,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:24,525 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 5 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:24,587 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2025-03-04 11:33:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:24,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-04 11:33:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:24,590 INFO L225 Difference]: With dead ends: 96 [2025-03-04 11:33:24,590 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 11:33:24,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:24,591 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:24,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 134 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 11:33:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2025-03-04 11:33:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 74 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2025-03-04 11:33:24,599 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 24 [2025-03-04 11:33:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:24,599 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2025-03-04 11:33:24,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2025-03-04 11:33:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:33:24,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:24,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:24,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:33:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 11:33:24,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:24,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1407689248, now seen corresponding path program 1 times [2025-03-04 11:33:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449960042] [2025-03-04 11:33:24,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:24,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:33:24,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:33:24,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:24,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449960042] [2025-03-04 11:33:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449960042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:25,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:25,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21993626] [2025-03-04 11:33:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:25,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:25,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:25,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:25,041 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:25,124 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-03-04 11:33:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:25,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 11:33:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:25,125 INFO L225 Difference]: With dead ends: 88 [2025-03-04 11:33:25,125 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 11:33:25,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:33:25,126 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:25,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 269 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 11:33:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-04 11:33:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 75 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2025-03-04 11:33:25,132 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 25 [2025-03-04 11:33:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:25,133 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2025-03-04 11:33:25,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2025-03-04 11:33:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:33:25,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:25,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:25,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:33:25,134 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:25,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1377474221, now seen corresponding path program 1 times [2025-03-04 11:33:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:25,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580578434] [2025-03-04 11:33:25,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:25,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:25,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:33:25,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:33:25,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:25,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598460159] [2025-03-04 11:33:25,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:25,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:25,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:25,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:25,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:33:25,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:33:25,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:33:25,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:25,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:25,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:33:25,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:25,213 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-03-04 11:33:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:25,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:25,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580578434] [2025-03-04 11:33:25,258 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:25,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598460159] [2025-03-04 11:33:25,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598460159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:25,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:25,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:33:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679607990] [2025-03-04 11:33:25,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:25,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:33:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:25,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:33:25,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:25,260 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:25,323 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2025-03-04 11:33:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:25,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-03-04 11:33:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:25,324 INFO L225 Difference]: With dead ends: 96 [2025-03-04 11:33:25,324 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 11:33:25,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:25,324 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:25,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 136 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 11:33:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2025-03-04 11:33:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 76 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-03-04 11:33:25,328 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 25 [2025-03-04 11:33:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:25,328 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-03-04 11:33:25,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-03-04 11:33:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:33:25,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:25,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:25,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:33:25,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:25,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:25,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash 688693699, now seen corresponding path program 1 times [2025-03-04 11:33:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:25,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495010153] [2025-03-04 11:33:25,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:25,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:25,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:33:25,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:33:25,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:25,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:25,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:25,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495010153] [2025-03-04 11:33:25,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495010153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:25,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:25,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:25,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645625846] [2025-03-04 11:33:25,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:25,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:25,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:25,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:25,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:25,705 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:25,795 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2025-03-04 11:33:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 11:33:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:25,796 INFO L225 Difference]: With dead ends: 87 [2025-03-04 11:33:25,796 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 11:33:25,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:33:25,797 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:25,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 274 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 11:33:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 11:33:25,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 77 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-03-04 11:33:25,800 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 26 [2025-03-04 11:33:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:25,800 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-03-04 11:33:25,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-03-04 11:33:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:33:25,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:25,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:33:25,801 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:25,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash -247972085, now seen corresponding path program 1 times [2025-03-04 11:33:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:25,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208915740] [2025-03-04 11:33:25,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:25,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:33:25,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:33:25,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:25,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208915740] [2025-03-04 11:33:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208915740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:33:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379437405] [2025-03-04 11:33:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:25,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:33:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:25,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:33:25,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:25,875 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:25,925 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2025-03-04 11:33:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:33:25,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-04 11:33:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:25,926 INFO L225 Difference]: With dead ends: 94 [2025-03-04 11:33:25,926 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 11:33:25,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:25,927 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:25,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 130 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:33:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 11:33:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2025-03-04 11:33:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.396551724137931) internal successors, (81), 79 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2025-03-04 11:33:25,930 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 26 [2025-03-04 11:33:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:25,930 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2025-03-04 11:33:25,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2025-03-04 11:33:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:33:25,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:25,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:25,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:33:25,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:25,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:25,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2077971703, now seen corresponding path program 1 times [2025-03-04 11:33:25,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:25,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149074294] [2025-03-04 11:33:25,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:25,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:25,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:33:25,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:33:25,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:25,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:26,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:26,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149074294] [2025-03-04 11:33:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149074294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:26,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:26,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457231398] [2025-03-04 11:33:26,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:26,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:26,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:26,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:26,007 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:26,088 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2025-03-04 11:33:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:26,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-03-04 11:33:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:26,089 INFO L225 Difference]: With dead ends: 93 [2025-03-04 11:33:26,090 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 11:33:26,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:26,090 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 26 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:26,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 162 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 11:33:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2025-03-04 11:33:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 80 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2025-03-04 11:33:26,094 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 28 [2025-03-04 11:33:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:26,094 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2025-03-04 11:33:26,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2025-03-04 11:33:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:33:26,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:26,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:26,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:33:26,095 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_25_to_33_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:26,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1432172961, now seen corresponding path program 1 times [2025-03-04 11:33:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:26,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600232591] [2025-03-04 11:33:26,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:26,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:26,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:33:26,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:33:26,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:26,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:26,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685290719] [2025-03-04 11:33:26,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:26,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:26,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:26,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:26,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:33:26,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:33:26,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:33:26,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:26,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:26,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 11:33:26,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:26,187 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-03-04 11:33:26,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 11:33:26,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 11:33:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:26,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600232591] [2025-03-04 11:33:26,427 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685290719] [2025-03-04 11:33:26,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685290719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:33:26,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:33:26,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2025-03-04 11:33:26,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356848777] [2025-03-04 11:33:26,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:33:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:26,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:33:26,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:33:26,428 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 15 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:26,663 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2025-03-04 11:33:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:33:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-03-04 11:33:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:26,664 INFO L225 Difference]: With dead ends: 94 [2025-03-04 11:33:26,664 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 11:33:26,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:33:26,665 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 170 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:26,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 357 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 11:33:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2025-03-04 11:33:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 78 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-03-04 11:33:26,669 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 30 [2025-03-04 11:33:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:26,670 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-03-04 11:33:26,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:26,670 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-03-04 11:33:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:33:26,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:26,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:26,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:26,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:33:26,873 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:26,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 7386665, now seen corresponding path program 1 times [2025-03-04 11:33:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:26,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428772396] [2025-03-04 11:33:26,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:26,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:33:26,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:33:26,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:26,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:26,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428772396] [2025-03-04 11:33:26,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428772396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:26,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:33:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240522816] [2025-03-04 11:33:26,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:26,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:33:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:26,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:33:26,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:26,969 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:27,053 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-03-04 11:33:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:33:27,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 11:33:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:27,054 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:33:27,054 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 11:33:27,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:27,055 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:27,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 126 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 11:33:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-04 11:33:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.35) internal successors, (81), 79 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2025-03-04 11:33:27,059 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 29 [2025-03-04 11:33:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:27,059 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2025-03-04 11:33:27,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2025-03-04 11:33:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:33:27,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:27,060 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:27,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:33:27,060 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_25_to_33_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:27,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1447688830, now seen corresponding path program 1 times [2025-03-04 11:33:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:27,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900655477] [2025-03-04 11:33:27,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:27,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:33:27,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:33:27,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:27,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:27,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219003993] [2025-03-04 11:33:27,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:27,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:27,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:27,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:27,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:33:27,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:33:27,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:33:27,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:27,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:27,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 11:33:27,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:27,167 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-03-04 11:33:27,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 11:33:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:27,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:28,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:28,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900655477] [2025-03-04 11:33:28,398 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:28,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219003993] [2025-03-04 11:33:28,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219003993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:28,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:33:28,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 11:33:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876434120] [2025-03-04 11:33:28,398 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:28,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:33:28,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:28,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:33:28,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=167, Unknown=1, NotChecked=0, Total=210 [2025-03-04 11:33:28,399 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 10 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:28,586 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2025-03-04 11:33:28,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:33:28,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-04 11:33:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:28,587 INFO L225 Difference]: With dead ends: 128 [2025-03-04 11:33:28,587 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 11:33:28,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=78, Invalid=263, Unknown=1, NotChecked=0, Total=342 [2025-03-04 11:33:28,588 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 90 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:28,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 366 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 11:33:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2025-03-04 11:33:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 97 states have internal predecessors, (105), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 11:33:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2025-03-04 11:33:28,594 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 31 [2025-03-04 11:33:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:28,595 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2025-03-04 11:33:28,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2025-03-04 11:33:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:33:28,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:28,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:28,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:28,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:33:28,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:28,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:28,800 INFO L85 PathProgramCache]: Analyzing trace with hash 228986631, now seen corresponding path program 1 times [2025-03-04 11:33:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:28,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675053879] [2025-03-04 11:33:28,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:28,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:28,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:33:28,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:33:28,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:28,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:28,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675053879] [2025-03-04 11:33:28,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675053879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:28,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:28,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:28,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305359743] [2025-03-04 11:33:28,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:28,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:28,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:28,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:28,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:28,920 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:29,018 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2025-03-04 11:33:29,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:29,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-03-04 11:33:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:29,019 INFO L225 Difference]: With dead ends: 113 [2025-03-04 11:33:29,019 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 11:33:29,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:29,019 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:29,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 149 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 11:33:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-04 11:33:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.358974358974359) internal successors, (106), 98 states have internal predecessors, (106), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 11:33:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2025-03-04 11:33:29,026 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 30 [2025-03-04 11:33:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:29,026 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2025-03-04 11:33:29,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2025-03-04 11:33:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:33:29,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:29,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:29,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 11:33:29,028 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_25_to_33_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:29,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1928680771, now seen corresponding path program 1 times [2025-03-04 11:33:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:29,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897805888] [2025-03-04 11:33:29,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:29,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:33:29,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:33:29,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:29,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:29,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897805888] [2025-03-04 11:33:29,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897805888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208722332] [2025-03-04 11:33:29,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:29,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:29,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:29,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:29,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:33:29,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:33:29,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:33:29,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:29,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:29,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 11:33:29,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:29,340 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-03-04 11:33:29,342 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-03-04 11:33:29,963 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-03-04 11:33:29,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 50 [2025-03-04 11:33:29,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 11:33:29,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-03-04 11:33:30,053 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-03-04 11:33:30,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2025-03-04 11:33:30,067 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-03-04 11:33:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:30,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:30,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208722332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:33:30,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:33:30,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 35 [2025-03-04 11:33:30,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133657729] [2025-03-04 11:33:30,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:30,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 11:33:30,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:30,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 11:33:30,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 11:33:30,597 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 36 states, 32 states have (on average 2.40625) internal successors, (77), 30 states have internal predecessors, (77), 8 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:33:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:31,841 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2025-03-04 11:33:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 11:33:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 2.40625) internal successors, (77), 30 states have internal predecessors, (77), 8 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2025-03-04 11:33:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:31,844 INFO L225 Difference]: With dead ends: 130 [2025-03-04 11:33:31,844 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 11:33:31,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=517, Invalid=2905, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 11:33:31,845 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 309 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:31,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 453 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:33:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 11:33:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 111. [2025-03-04 11:33:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 97 states have internal predecessors, (104), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 11:33:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2025-03-04 11:33:31,857 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 32 [2025-03-04 11:33:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:31,857 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2025-03-04 11:33:31,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 2.40625) internal successors, (77), 30 states have internal predecessors, (77), 8 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:33:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2025-03-04 11:33:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:33:31,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:31,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:31,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:32,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:32,062 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:32,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1491349017, now seen corresponding path program 1 times [2025-03-04 11:33:32,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:32,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887786338] [2025-03-04 11:33:32,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:32,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:33:32,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:33:32,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:32,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:32,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:32,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887786338] [2025-03-04 11:33:32,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887786338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:32,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:32,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:32,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525214937] [2025-03-04 11:33:32,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:32,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:32,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:32,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:32,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:32,204 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:32,373 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2025-03-04 11:33:32,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-04 11:33:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:32,374 INFO L225 Difference]: With dead ends: 113 [2025-03-04 11:33:32,374 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 11:33:32,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:32,375 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:32,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 11:33:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 11:33:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 88 states have internal predecessors, (94), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:33:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-03-04 11:33:32,380 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 31 [2025-03-04 11:33:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:32,380 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-03-04 11:33:32,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-03-04 11:33:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:33:32,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:32,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:32,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:33:32,380 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_25_to_33_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:32,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash 340438240, now seen corresponding path program 1 times [2025-03-04 11:33:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:32,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149378096] [2025-03-04 11:33:32,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:32,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:33:32,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:33:32,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:32,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:32,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:32,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149378096] [2025-03-04 11:33:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149378096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:32,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896149968] [2025-03-04 11:33:32,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:32,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:32,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:32,600 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:32,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:33:32,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:33:32,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:33:32,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:32,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:32,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 11:33:32,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:32,680 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-03-04 11:33:32,686 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-03-04 11:33:32,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 11:33:32,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:33:32,881 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-03-04 11:33:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:32,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896149968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:33:33,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:33:33,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2025-03-04 11:33:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892372393] [2025-03-04 11:33:33,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:33,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:33:33,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:33,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:33:33,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:33:33,024 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 24 states, 20 states have (on average 3.8) internal successors, (76), 19 states have internal predecessors, (76), 8 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:33:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:33,331 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2025-03-04 11:33:33,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:33:33,332 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.8) internal successors, (76), 19 states have internal predecessors, (76), 8 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-03-04 11:33:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:33,334 INFO L225 Difference]: With dead ends: 116 [2025-03-04 11:33:33,334 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 11:33:33,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:33:33,336 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 127 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:33,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 463 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 11:33:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2025-03-04 11:33:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 88 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:33:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-03-04 11:33:33,343 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 33 [2025-03-04 11:33:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:33,343 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-03-04 11:33:33,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.8) internal successors, (76), 19 states have internal predecessors, (76), 8 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:33:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-03-04 11:33:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:33:33,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:33,344 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:33,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:33,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:33,548 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_25_to_33_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:33,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1963650843, now seen corresponding path program 1 times [2025-03-04 11:33:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:33,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005367838] [2025-03-04 11:33:33,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:33,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:33,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:33:33,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:33:33,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:33,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:33,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960646589] [2025-03-04 11:33:33,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:33,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:33,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:33,568 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:33,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:33:33,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:33:33,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:33:33,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:33,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:33,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 11:33:33,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:33,652 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-03-04 11:33:33,654 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-03-04 11:33:33,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 11:33:33,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-04 11:33:33,854 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 33 treesize of output 17 [2025-03-04 11:33:33,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 11:33:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:33,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:34,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005367838] [2025-03-04 11:33:34,287 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960646589] [2025-03-04 11:33:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960646589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:34,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:33:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 11:33:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609075222] [2025-03-04 11:33:34,287 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:34,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:33:34,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:34,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:33:34,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:33:34,288 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:34,637 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2025-03-04 11:33:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:33:34,638 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-04 11:33:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:34,638 INFO L225 Difference]: With dead ends: 112 [2025-03-04 11:33:34,638 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 11:33:34,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:33:34,639 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 78 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:34,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 344 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 11:33:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2025-03-04 11:33:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 88 states have internal predecessors, (92), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:33:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2025-03-04 11:33:34,648 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 34 [2025-03-04 11:33:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:34,648 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2025-03-04 11:33:34,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2025-03-04 11:33:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:33:34,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:34,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:34,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:33:34,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 11:33:34,850 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_25_to_33_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:34,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash 743633982, now seen corresponding path program 1 times [2025-03-04 11:33:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:34,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010209581] [2025-03-04 11:33:34,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:34,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:33:34,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:33:34,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:34,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010209581] [2025-03-04 11:33:35,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010209581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958284784] [2025-03-04 11:33:35,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:35,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:35,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:35,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:35,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:33:35,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:33:35,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:33:35,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:35,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:35,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 11:33:35,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:35,149 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-03-04 11:33:35,155 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-03-04 11:33:35,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 11:33:35,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:33:35,347 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-03-04 11:33:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:35,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:38,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958284784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:38,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:33:38,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2025-03-04 11:33:38,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846491523] [2025-03-04 11:33:38,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:38,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:33:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:38,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:33:38,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=432, Unknown=1, NotChecked=0, Total=506 [2025-03-04 11:33:38,977 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 17 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:39,264 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2025-03-04 11:33:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:33:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-03-04 11:33:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:39,265 INFO L225 Difference]: With dead ends: 114 [2025-03-04 11:33:39,265 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 11:33:39,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=124, Invalid=631, Unknown=1, NotChecked=0, Total=756 [2025-03-04 11:33:39,266 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 73 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:39,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 602 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 11:33:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2025-03-04 11:33:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3) internal successors, (91), 88 states have internal predecessors, (91), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:33:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2025-03-04 11:33:39,272 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 35 [2025-03-04 11:33:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:39,272 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2025-03-04 11:33:39,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2025-03-04 11:33:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:33:39,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:39,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:39,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:39,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 11:33:39,477 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_25_to_33_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 11:33:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1577816953, now seen corresponding path program 1 times [2025-03-04 11:33:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597289715] [2025-03-04 11:33:39,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:39,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:33:39,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:33:39,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:39,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat