./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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_sqrt1.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 b23f88f1df76f11fbfc8e6288f4ade0e00ecdc2b8889a67f3774db6dfccf1d90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:46:38,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:46:38,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:46:38,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:46:38,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:46:38,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:46:38,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:46:38,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:46:38,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:46:38,525 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:46:38,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:46:38,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:46:38,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:46:38,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:46:38,526 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:46:38,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:46:38,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:46:38,527 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:46:38,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:46:38,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:46:38,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:46:38,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:46:38,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:46:38,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:46:38,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:46:38,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:46:38,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:46:38,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:46:38,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:46:38,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:46:38,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:46:38,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:46:38,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:46:38,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:46:38,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:46:38,530 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 -> b23f88f1df76f11fbfc8e6288f4ade0e00ecdc2b8889a67f3774db6dfccf1d90 [2025-03-09 02:46:38,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:46:38,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:46:38,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:46:38,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:46:38,766 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:46:38,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c [2025-03-09 02:46:39,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c84e4b6/facbdc909ddd46b78dc60bc44ef9739f/FLAG4c1afcbf2 [2025-03-09 02:46:40,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:46:40,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c [2025-03-09 02:46:40,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c84e4b6/facbdc909ddd46b78dc60bc44ef9739f/FLAG4c1afcbf2 [2025-03-09 02:46:40,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4c84e4b6/facbdc909ddd46b78dc60bc44ef9739f [2025-03-09 02:46:40,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:46:40,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:46:40,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:46:40,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:46:40,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:46:40,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c938375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40, skipping insertion in model container [2025-03-09 02:46:40,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:46:40,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:46:40,606 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:46:40,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:46:40,641 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:46:40,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40 WrapperNode [2025-03-09 02:46:40,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:46:40,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:46:40,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:46:40,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:46:40,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,674 INFO L138 Inliner]: procedures = 16, calls = 67, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2025-03-09 02:46:40,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:46:40,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:46:40,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:46:40,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:46:40,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,707 INFO L175 MemorySlicer]: Split 41 memory accesses to 6 slices as follows [2, 2, 8, 9, 8, 12]. 29 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8, 0, 0, 0]. The 7 writes are split as follows [0, 1, 0, 2, 2, 2]. [2025-03-09 02:46:40,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:46:40,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:46:40,725 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:46:40,725 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:46:40,726 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (1/1) ... [2025-03-09 02:46:40,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:46:40,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:40,754 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-09 02:46:40,756 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-09 02:46:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:46:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_39_0 [2025-03-09 02:46:40,775 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_39_0 [2025-03-09 02:46:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:46:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:46:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:46:40,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:46:40,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:46:40,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:46:40,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:46:40,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:46:40,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:46:40,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:46:40,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:46:40,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:46:40,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:46:40,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:46:40,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:46:40,858 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:46:40,860 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:46:41,100 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L76: call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~0#1.offset;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset;call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset);havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-09 02:46:41,118 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-03-09 02:46:41,118 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:46:41,128 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:46:41,129 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:46:41,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:46:41 BoogieIcfgContainer [2025-03-09 02:46:41,130 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:46:41,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:46:41,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:46:41,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:46:41,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:46:40" (1/3) ... [2025-03-09 02:46:41,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd57d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:41, skipping insertion in model container [2025-03-09 02:46:41,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:40" (2/3) ... [2025-03-09 02:46:41,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd57d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:41, skipping insertion in model container [2025-03-09 02:46:41,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:46:41" (3/3) ... [2025-03-09 02:46:41,138 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_sqrt1.c [2025-03-09 02:46:41,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:46:41,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_sqrt1.c that has 3 procedures, 131 locations, 1 initial locations, 0 loop locations, and 50 error locations. [2025-03-09 02:46:41,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:46:41,205 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;@1a64a52b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:46:41,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-09 02:46:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 121 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:46:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:46:41,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:41,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:46:41,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_28_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:41,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash 349309519, now seen corresponding path program 1 times [2025-03-09 02:46:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:41,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327844382] [2025-03-09 02:46:41,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:41,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:41,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:46:41,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:46:41,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:41,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:41,584 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-09 02:46:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327844382] [2025-03-09 02:46:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327844382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:41,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354855103] [2025-03-09 02:46:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:41,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:41,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:41,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:41,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:41,604 INFO L87 Difference]: Start difference. First operand has 131 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 121 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:41,775 INFO L93 Difference]: Finished difference Result 328 states and 365 transitions. [2025-03-09 02:46:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:41,777 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-09 02:46:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:41,782 INFO L225 Difference]: With dead ends: 328 [2025-03-09 02:46:41,782 INFO L226 Difference]: Without dead ends: 194 [2025-03-09 02:46:41,785 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-09 02:46:41,787 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 118 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:41,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 588 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-09 02:46:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 157. [2025-03-09 02:46:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.7340425531914894) internal successors, (163), 144 states have internal predecessors, (163), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-09 02:46:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2025-03-09 02:46:41,827 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 6 [2025-03-09 02:46:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:41,827 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2025-03-09 02:46:41,828 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-09 02:46:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2025-03-09 02:46:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:46:41,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:41,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:41,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:46:41,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_28_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:41,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1938355172, now seen corresponding path program 1 times [2025-03-09 02:46:41,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:41,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703617197] [2025-03-09 02:46:41,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:41,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:46:41,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:46:41,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:41,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:41,990 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-09 02:46:41,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:41,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703617197] [2025-03-09 02:46:41,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703617197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:41,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:41,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281159572] [2025-03-09 02:46:41,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:41,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:41,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:41,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:41,992 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:42,115 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2025-03-09 02:46:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:42,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-09 02:46:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:42,116 INFO L225 Difference]: With dead ends: 194 [2025-03-09 02:46:42,117 INFO L226 Difference]: Without dead ends: 192 [2025-03-09 02:46:42,117 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-09 02:46:42,117 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 113 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:42,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 553 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-09 02:46:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2025-03-09 02:46:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 144 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-09 02:46:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2025-03-09 02:46:42,126 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 16 [2025-03-09 02:46:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:42,126 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2025-03-09 02:46:42,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2025-03-09 02:46:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:46:42,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:42,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:42,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:46:42,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_28_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:42,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1256485438, now seen corresponding path program 1 times [2025-03-09 02:46:42,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:42,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783525513] [2025-03-09 02:46:42,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:42,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:46:42,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:46:42,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:42,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:42,299 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-09 02:46:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:42,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783525513] [2025-03-09 02:46:42,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783525513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:42,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:42,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:42,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925162429] [2025-03-09 02:46:42,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:42,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:42,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:42,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:42,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:42,301 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:42,409 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2025-03-09 02:46:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-09 02:46:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:42,410 INFO L225 Difference]: With dead ends: 192 [2025-03-09 02:46:42,410 INFO L226 Difference]: Without dead ends: 190 [2025-03-09 02:46:42,411 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-09 02:46:42,411 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:42,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 550 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-09 02:46:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 157. [2025-03-09 02:46:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 144 states have internal predecessors, (159), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-09 02:46:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2025-03-09 02:46:42,430 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 18 [2025-03-09 02:46:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:42,430 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2025-03-09 02:46:42,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2025-03-09 02:46:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:46:42,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:42,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:42,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:46:42,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_28_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:42,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -596695136, now seen corresponding path program 1 times [2025-03-09 02:46:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:42,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224514924] [2025-03-09 02:46:42,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:42,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:46:42,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:46:42,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:42,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:42,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142025521] [2025-03-09 02:46:42,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:42,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:42,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:42,462 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-09 02:46:42,464 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-09 02:46:42,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:46:42,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:46:42,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:42,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:42,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:46:42,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:42,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:42,677 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-09 02:46:42,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:42,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:42,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224514924] [2025-03-09 02:46:42,678 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:42,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142025521] [2025-03-09 02:46:42,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142025521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:42,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:42,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:46:42,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775834936] [2025-03-09 02:46:42,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:42,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:46:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:42,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:46:42,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:42,679 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:42,825 INFO L93 Difference]: Finished difference Result 228 states and 237 transitions. [2025-03-09 02:46:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:42,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-09 02:46:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:42,827 INFO L225 Difference]: With dead ends: 228 [2025-03-09 02:46:42,827 INFO L226 Difference]: Without dead ends: 226 [2025-03-09 02:46:42,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:46:42,827 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 137 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:42,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 626 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-09 02:46:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 175. [2025-03-09 02:46:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.6697247706422018) internal successors, (182), 159 states have internal predecessors, (182), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:46:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 207 transitions. [2025-03-09 02:46:42,841 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 207 transitions. Word has length 20 [2025-03-09 02:46:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:42,841 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 207 transitions. [2025-03-09 02:46:42,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 207 transitions. [2025-03-09 02:46:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:46:42,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:42,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:42,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:43,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:43,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_28_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:43,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1726467553, now seen corresponding path program 1 times [2025-03-09 02:46:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:43,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893934167] [2025-03-09 02:46:43,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:43,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:46:43,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:46:43,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:43,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510066353] [2025-03-09 02:46:43,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:43,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:43,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:43,065 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-09 02:46:43,069 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-09 02:46:43,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:46:43,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:46:43,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:43,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:43,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 02:46:43,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:43,144 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-09 02:46:43,175 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-09 02:46:43,315 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-09 02:46:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:43,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:43,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:43,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893934167] [2025-03-09 02:46:43,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:43,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510066353] [2025-03-09 02:46:43,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510066353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:43,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:43,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-09 02:46:43,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803057758] [2025-03-09 02:46:43,424 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:43,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:46:43,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:43,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:46:43,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:46:43,425 INFO L87 Difference]: Start difference. First operand 175 states and 207 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:47,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:51,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:55,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:55,835 INFO L93 Difference]: Finished difference Result 230 states and 239 transitions. [2025-03-09 02:46:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 02:46:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-03-09 02:46:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:55,837 INFO L225 Difference]: With dead ends: 230 [2025-03-09 02:46:55,837 INFO L226 Difference]: Without dead ends: 229 [2025-03-09 02:46:55,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:46:55,838 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 204 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:55,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 928 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 353 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2025-03-09 02:46:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-09 02:46:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 175. [2025-03-09 02:46:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.6605504587155964) internal successors, (181), 159 states have internal predecessors, (181), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:46:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 206 transitions. [2025-03-09 02:46:55,850 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 206 transitions. Word has length 28 [2025-03-09 02:46:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:55,851 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 206 transitions. [2025-03-09 02:46:55,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 206 transitions. [2025-03-09 02:46:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:46:55,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:55,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:55,858 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-09 02:46:56,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:56,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_28_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:56,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1980886600, now seen corresponding path program 1 times [2025-03-09 02:46:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:56,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932130604] [2025-03-09 02:46:56,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:56,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:46:56,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:46:56,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:56,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:56,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282694915] [2025-03-09 02:46:56,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:56,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:56,074 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-09 02:46:56,087 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-09 02:46:56,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:46:56,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:46:56,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:56,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:56,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 02:46:56,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:56,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 11 treesize of output 7 [2025-03-09 02:46:56,363 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-09 02:46:56,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:56,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:56,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932130604] [2025-03-09 02:46:56,468 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:56,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282694915] [2025-03-09 02:46:56,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282694915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:56,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:56,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-09 02:46:56,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159635297] [2025-03-09 02:46:56,469 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:56,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:46:56,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:56,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:46:56,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:46:56,470 INFO L87 Difference]: Start difference. First operand 175 states and 206 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:56,960 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2025-03-09 02:46:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:46:56,960 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-09 02:46:56,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:56,961 INFO L225 Difference]: With dead ends: 229 [2025-03-09 02:46:56,961 INFO L226 Difference]: Without dead ends: 228 [2025-03-09 02:46:56,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:46:56,962 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 230 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:56,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1042 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:46:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-09 02:46:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 175. [2025-03-09 02:46:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.651376146788991) internal successors, (180), 159 states have internal predecessors, (180), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:46:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 205 transitions. [2025-03-09 02:46:56,969 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 205 transitions. Word has length 29 [2025-03-09 02:46:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:56,969 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 205 transitions. [2025-03-09 02:46:56,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2025-03-09 02:46:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:56,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:56,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:56,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:57,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:57,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_28_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:57,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1277942463, now seen corresponding path program 1 times [2025-03-09 02:46:57,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:57,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053593225] [2025-03-09 02:46:57,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:57,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:57,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:57,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:57,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:46:57,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:57,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053593225] [2025-03-09 02:46:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053593225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:57,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:57,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193635958] [2025-03-09 02:46:57,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:57,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:57,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:57,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:57,292 INFO L87 Difference]: Start difference. First operand 175 states and 205 transitions. Second operand has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:46:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:57,405 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2025-03-09 02:46:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:57,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-09 02:46:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:57,407 INFO L225 Difference]: With dead ends: 212 [2025-03-09 02:46:57,408 INFO L226 Difference]: Without dead ends: 210 [2025-03-09 02:46:57,408 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-09 02:46:57,409 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 121 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:57,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 527 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-09 02:46:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2025-03-09 02:46:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.6330275229357798) internal successors, (178), 159 states have internal predecessors, (178), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:46:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2025-03-09 02:46:57,417 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 30 [2025-03-09 02:46:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:57,417 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2025-03-09 02:46:57,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:46:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2025-03-09 02:46:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:46:57,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:57,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:57,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:46:57,418 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_28_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash -257939555, now seen corresponding path program 1 times [2025-03-09 02:46:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920040557] [2025-03-09 02:46:57,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:57,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:46:57,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:46:57,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:57,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:57,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979611106] [2025-03-09 02:46:57,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:57,436 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-09 02:46:57,438 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-09 02:46:57,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:46:57,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:46:57,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:57,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:57,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-09 02:46:57,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:57,502 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-09 02:46:57,506 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-09 02:46:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:57,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:58,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-09 02:46:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:46:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920040557] [2025-03-09 02:46:58,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979611106] [2025-03-09 02:46:58,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979611106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:46:58,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:46:58,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2025-03-09 02:46:58,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119007642] [2025-03-09 02:46:58,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:58,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 02:46:58,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:58,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 02:46:58,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:46:58,130 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:46:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:59,018 INFO L93 Difference]: Finished difference Result 230 states and 239 transitions. [2025-03-09 02:46:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 02:46:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2025-03-09 02:46:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:59,019 INFO L225 Difference]: With dead ends: 230 [2025-03-09 02:46:59,019 INFO L226 Difference]: Without dead ends: 228 [2025-03-09 02:46:59,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 02:46:59,020 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 361 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:59,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1120 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:46:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-09 02:46:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 175. [2025-03-09 02:46:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.614678899082569) internal successors, (176), 159 states have internal predecessors, (176), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:46:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2025-03-09 02:46:59,029 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 32 [2025-03-09 02:46:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:59,030 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2025-03-09 02:46:59,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:46:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2025-03-09 02:46:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 02:46:59,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:59,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:59,038 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-09 02:46:59,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:59,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_28_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:59,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:59,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1228190843, now seen corresponding path program 1 times [2025-03-09 02:46:59,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:59,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126489599] [2025-03-09 02:46:59,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:59,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:59,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:46:59,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:46:59,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:59,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:46:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:59,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126489599] [2025-03-09 02:46:59,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126489599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:59,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:59,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271566853] [2025-03-09 02:46:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:59,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:59,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:59,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:59,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:59,372 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:46:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:59,472 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2025-03-09 02:46:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:59,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-03-09 02:46:59,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:59,474 INFO L225 Difference]: With dead ends: 212 [2025-03-09 02:46:59,474 INFO L226 Difference]: Without dead ends: 210 [2025-03-09 02:46:59,474 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-09 02:46:59,474 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 103 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:59,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 533 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-09 02:46:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2025-03-09 02:46:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.5963302752293578) internal successors, (174), 159 states have internal predecessors, (174), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:46:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2025-03-09 02:46:59,481 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 34 [2025-03-09 02:46:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:59,481 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2025-03-09 02:46:59,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:46:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2025-03-09 02:46:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:46:59,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:59,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:46:59,482 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_28_to_39_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:59,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash -824606375, now seen corresponding path program 1 times [2025-03-09 02:46:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951595016] [2025-03-09 02:46:59,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:59,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:46:59,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:46:59,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:59,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:46:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951595016] [2025-03-09 02:46:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951595016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:59,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:59,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294494747] [2025-03-09 02:46:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:59,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:59,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:59,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:59,629 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:46:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:59,811 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2025-03-09 02:46:59,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:59,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-09 02:46:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:59,813 INFO L225 Difference]: With dead ends: 210 [2025-03-09 02:46:59,813 INFO L226 Difference]: Without dead ends: 208 [2025-03-09 02:46:59,813 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-09 02:46:59,813 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 97 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:59,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 614 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-09 02:46:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 175. [2025-03-09 02:46:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.5779816513761469) internal successors, (172), 159 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:46:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2025-03-09 02:46:59,820 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 197 transitions. Word has length 36 [2025-03-09 02:46:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:59,821 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 197 transitions. [2025-03-09 02:46:59,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:46:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 197 transitions. [2025-03-09 02:46:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 02:46:59,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:59,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:59,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:46:59,822 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_28_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:46:59,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash 207006144, now seen corresponding path program 1 times [2025-03-09 02:46:59,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:59,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333367640] [2025-03-09 02:46:59,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:59,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:59,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:46:59,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:46:59,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:59,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:47:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333367640] [2025-03-09 02:47:00,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333367640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:00,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:00,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572639162] [2025-03-09 02:47:00,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:00,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:00,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:00,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:00,063 INFO L87 Difference]: Start difference. First operand 175 states and 197 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:47:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:00,293 INFO L93 Difference]: Finished difference Result 200 states and 210 transitions. [2025-03-09 02:47:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:47:00,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-03-09 02:47:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:00,294 INFO L225 Difference]: With dead ends: 200 [2025-03-09 02:47:00,294 INFO L226 Difference]: Without dead ends: 198 [2025-03-09 02:47:00,294 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-09 02:47:00,294 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 95 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:00,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 585 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-09 02:47:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2025-03-09 02:47:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.5596330275229358) internal successors, (170), 159 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:47:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2025-03-09 02:47:00,301 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 37 [2025-03-09 02:47:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:00,301 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2025-03-09 02:47:00,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:47:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2025-03-09 02:47:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 02:47:00,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:00,302 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:47:00,302 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_28_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash 814748734, now seen corresponding path program 1 times [2025-03-09 02:47:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643370755] [2025-03-09 02:47:00,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:00,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:47:00,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:47:00,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:00,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:00,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:00,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643370755] [2025-03-09 02:47:00,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643370755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:00,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:00,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:00,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641831527] [2025-03-09 02:47:00,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:00,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:00,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:00,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:00,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:00,409 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:00,479 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2025-03-09 02:47:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:00,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-09 02:47:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:00,481 INFO L225 Difference]: With dead ends: 185 [2025-03-09 02:47:00,481 INFO L226 Difference]: Without dead ends: 183 [2025-03-09 02:47:00,481 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-09 02:47:00,482 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:00,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 566 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-09 02:47:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2025-03-09 02:47:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 161 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:47:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2025-03-09 02:47:00,490 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 47 [2025-03-09 02:47:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:00,491 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2025-03-09 02:47:00,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2025-03-09 02:47:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:47:00,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:00,491 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:00,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:47:00,491 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_28_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:00,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1289484828, now seen corresponding path program 1 times [2025-03-09 02:47:00,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483070514] [2025-03-09 02:47:00,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:00,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:47:00,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:47:00,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:00,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:00,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:00,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483070514] [2025-03-09 02:47:00,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483070514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:00,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:00,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:00,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141547534] [2025-03-09 02:47:00,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:00,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:00,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:00,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:00,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:00,587 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:00,677 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2025-03-09 02:47:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-09 02:47:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:00,678 INFO L225 Difference]: With dead ends: 204 [2025-03-09 02:47:00,679 INFO L226 Difference]: Without dead ends: 202 [2025-03-09 02:47:00,679 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-09 02:47:00,680 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 72 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:00,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 561 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-09 02:47:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 179. [2025-03-09 02:47:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 163 states have internal predecessors, (174), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-09 02:47:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 199 transitions. [2025-03-09 02:47:00,689 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 199 transitions. Word has length 49 [2025-03-09 02:47:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:00,689 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 199 transitions. [2025-03-09 02:47:00,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 199 transitions. [2025-03-09 02:47:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:47:00,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:00,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:00,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:47:00,690 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:00,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:00,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1319373851, now seen corresponding path program 1 times [2025-03-09 02:47:00,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:00,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492105887] [2025-03-09 02:47:00,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:00,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:47:00,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:47:00,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:00,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492105887] [2025-03-09 02:47:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492105887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:00,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:00,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951441175] [2025-03-09 02:47:00,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:00,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:00,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:00,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:00,765 INFO L87 Difference]: Start difference. First operand 179 states and 199 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:00,840 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2025-03-09 02:47:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:00,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-03-09 02:47:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:00,842 INFO L225 Difference]: With dead ends: 187 [2025-03-09 02:47:00,842 INFO L226 Difference]: Without dead ends: 183 [2025-03-09 02:47:00,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:00,842 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 42 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:00,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 366 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-09 02:47:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-03-09 02:47:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 114 states have (on average 1.5) internal successors, (171), 164 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-09 02:47:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2025-03-09 02:47:00,851 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 50 [2025-03-09 02:47:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:00,851 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2025-03-09 02:47:00,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2025-03-09 02:47:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 02:47:00,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:00,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:00,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:47:00,854 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:00,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2050629638, now seen corresponding path program 1 times [2025-03-09 02:47:00,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:00,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904490274] [2025-03-09 02:47:00,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:00,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:00,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:47:00,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:47:00,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:00,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:01,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904490274] [2025-03-09 02:47:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904490274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181807884] [2025-03-09 02:47:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:01,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:01,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:01,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:01,133 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:01,258 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2025-03-09 02:47:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:47:01,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-09 02:47:01,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:01,259 INFO L225 Difference]: With dead ends: 195 [2025-03-09 02:47:01,260 INFO L226 Difference]: Without dead ends: 194 [2025-03-09 02:47:01,260 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-09 02:47:01,260 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 60 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:01,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 621 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-09 02:47:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2025-03-09 02:47:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 165 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-09 02:47:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2025-03-09 02:47:01,266 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 51 [2025-03-09 02:47:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:01,266 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2025-03-09 02:47:01,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2025-03-09 02:47:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 02:47:01,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:01,267 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:01,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:47:01,267 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:01,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash 854990633, now seen corresponding path program 1 times [2025-03-09 02:47:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060851333] [2025-03-09 02:47:01,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:01,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:47:01,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:47:01,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:01,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:01,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060851333] [2025-03-09 02:47:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060851333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:01,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218418051] [2025-03-09 02:47:01,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:01,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:01,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:01,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:01,497 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand has 7 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:01,626 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2025-03-09 02:47:01,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:47:01,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-09 02:47:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:01,627 INFO L225 Difference]: With dead ends: 195 [2025-03-09 02:47:01,627 INFO L226 Difference]: Without dead ends: 194 [2025-03-09 02:47:01,627 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-09 02:47:01,628 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 59 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:01,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 626 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-09 02:47:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 183. [2025-03-09 02:47:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 166 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-09 02:47:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2025-03-09 02:47:01,635 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 52 [2025-03-09 02:47:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:01,635 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2025-03-09 02:47:01,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2025-03-09 02:47:01,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:47:01,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:01,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:01,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:47:01,637 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_28_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:01,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2134946981, now seen corresponding path program 1 times [2025-03-09 02:47:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:01,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005885574] [2025-03-09 02:47:01,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:01,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:47:01,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:47:01,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:01,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:01,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:01,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005885574] [2025-03-09 02:47:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005885574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683716056] [2025-03-09 02:47:01,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:01,858 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-09 02:47:01,859 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-09 02:47:01,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:47:01,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:47:01,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:01,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:01,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 02:47:01,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:01,944 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-09 02:47:01,977 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 7 treesize of output 3 [2025-03-09 02:47:02,169 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-09 02:47:02,182 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-09 02:47:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:47:02,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:47:02,451 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 25 treesize of output 17 [2025-03-09 02:47:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:47:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683716056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:47:02,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:47:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 28 [2025-03-09 02:47:02,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510173617] [2025-03-09 02:47:02,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:47:02,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 02:47:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:02,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 02:47:02,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:47:02,520 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand has 29 states, 25 states have (on average 4.8) internal successors, (120), 24 states have internal predecessors, (120), 10 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-09 02:47:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:03,188 INFO L93 Difference]: Finished difference Result 205 states and 219 transitions. [2025-03-09 02:47:03,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 02:47:03,189 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.8) internal successors, (120), 24 states have internal predecessors, (120), 10 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 56 [2025-03-09 02:47:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:03,190 INFO L225 Difference]: With dead ends: 205 [2025-03-09 02:47:03,190 INFO L226 Difference]: Without dead ends: 202 [2025-03-09 02:47:03,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1485, Unknown=0, NotChecked=0, Total=1722 [2025-03-09 02:47:03,191 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 569 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:03,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1900 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:47:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-09 02:47:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2025-03-09 02:47:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 163 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-09 02:47:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2025-03-09 02:47:03,200 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 56 [2025-03-09 02:47:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:03,200 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2025-03-09 02:47:03,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.8) internal successors, (120), 24 states have internal predecessors, (120), 10 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-09 02:47:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2025-03-09 02:47:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:47:03,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:03,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:03,207 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-09 02:47:03,401 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,SelfDestructingSolverStorable16 [2025-03-09 02:47:03,402 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_28_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:03,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:03,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1758847004, now seen corresponding path program 1 times [2025-03-09 02:47:03,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:03,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078836215] [2025-03-09 02:47:03,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:03,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:03,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:47:03,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:47:03,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:03,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078836215] [2025-03-09 02:47:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078836215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192665889] [2025-03-09 02:47:03,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:03,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:03,653 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-09 02:47:03,654 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-09 02:47:03,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:47:03,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:47:03,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:03,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:03,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 02:47:03,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:03,737 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-09 02:47:03,771 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 7 treesize of output 3 [2025-03-09 02:47:03,965 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-09 02:47:03,978 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-09 02:47:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:47:03,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:47:04,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-09 02:47:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:47:04,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192665889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:47:04,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:47:04,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 28 [2025-03-09 02:47:04,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45145787] [2025-03-09 02:47:04,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:47:04,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 02:47:04,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:04,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 02:47:04,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:47:04,245 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand has 29 states, 25 states have (on average 4.88) internal successors, (122), 24 states have internal predecessors, (122), 10 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-09 02:47:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:04,783 INFO L93 Difference]: Finished difference Result 334 states and 356 transitions. [2025-03-09 02:47:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:47:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.88) internal successors, (122), 24 states have internal predecessors, (122), 10 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 57 [2025-03-09 02:47:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:04,785 INFO L225 Difference]: With dead ends: 334 [2025-03-09 02:47:04,785 INFO L226 Difference]: Without dead ends: 331 [2025-03-09 02:47:04,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 02:47:04,786 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 574 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:04,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1527 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:47:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-09 02:47:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 257. [2025-03-09 02:47:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.521978021978022) internal successors, (277), 230 states have internal predecessors, (277), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:47:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 323 transitions. [2025-03-09 02:47:04,796 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 323 transitions. Word has length 57 [2025-03-09 02:47:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:04,796 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 323 transitions. [2025-03-09 02:47:04,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.88) internal successors, (122), 24 states have internal predecessors, (122), 10 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-09 02:47:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 323 transitions. [2025-03-09 02:47:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:47:04,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:04,797 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:47:04,806 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-09 02:47:04,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 02:47:04,998 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:04,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:04,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1609272483, now seen corresponding path program 1 times [2025-03-09 02:47:04,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:04,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627882852] [2025-03-09 02:47:04,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:04,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:05,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:47:05,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:47:05,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:05,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:47:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627882852] [2025-03-09 02:47:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627882852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:05,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714927532] [2025-03-09 02:47:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:05,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:05,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:05,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:05,067 INFO L87 Difference]: Start difference. First operand 257 states and 323 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:05,142 INFO L93 Difference]: Finished difference Result 262 states and 324 transitions. [2025-03-09 02:47:05,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:05,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-03-09 02:47:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:05,145 INFO L225 Difference]: With dead ends: 262 [2025-03-09 02:47:05,145 INFO L226 Difference]: Without dead ends: 260 [2025-03-09 02:47:05,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:05,146 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:05,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 348 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-09 02:47:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2025-03-09 02:47:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.510989010989011) internal successors, (275), 230 states have internal predecessors, (275), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:47:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 321 transitions. [2025-03-09 02:47:05,159 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 321 transitions. Word has length 60 [2025-03-09 02:47:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:05,160 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 321 transitions. [2025-03-09 02:47:05,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 321 transitions. [2025-03-09 02:47:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 02:47:05,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:05,161 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:47:05,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:47:05,161 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:05,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:05,161 INFO L85 PathProgramCache]: Analyzing trace with hash 322632161, now seen corresponding path program 1 times [2025-03-09 02:47:05,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893489591] [2025-03-09 02:47:05,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:05,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:47:05,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:47:05,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:05,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:47:05,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893489591] [2025-03-09 02:47:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893489591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:05,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:05,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:05,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090275626] [2025-03-09 02:47:05,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:05,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:05,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:05,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:05,243 INFO L87 Difference]: Start difference. First operand 257 states and 321 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:05,321 INFO L93 Difference]: Finished difference Result 260 states and 322 transitions. [2025-03-09 02:47:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:05,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-09 02:47:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:05,323 INFO L225 Difference]: With dead ends: 260 [2025-03-09 02:47:05,323 INFO L226 Difference]: Without dead ends: 258 [2025-03-09 02:47:05,323 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-09 02:47:05,324 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 29 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:05,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 343 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-09 02:47:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2025-03-09 02:47:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.5) internal successors, (273), 230 states have internal predecessors, (273), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:47:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 319 transitions. [2025-03-09 02:47:05,337 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 319 transitions. Word has length 62 [2025-03-09 02:47:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:05,337 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 319 transitions. [2025-03-09 02:47:05,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 319 transitions. [2025-03-09 02:47:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:47:05,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:05,338 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:47:05,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 02:47:05,338 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:05,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash 811863839, now seen corresponding path program 1 times [2025-03-09 02:47:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175244885] [2025-03-09 02:47:05,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:05,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:47:05,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:47:05,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:05,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:05,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178580539] [2025-03-09 02:47:05,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:05,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:05,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:05,357 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-09 02:47:05,359 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-09 02:47:05,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:47:05,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:47:05,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:05,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:05,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:47:05,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:05,439 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-09 02:47:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:05,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:05,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:05,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175244885] [2025-03-09 02:47:05,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:05,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178580539] [2025-03-09 02:47:05,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178580539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:05,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:05,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:05,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625973763] [2025-03-09 02:47:05,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:05,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:05,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:05,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:05,537 INFO L87 Difference]: Start difference. First operand 257 states and 319 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:05,672 INFO L93 Difference]: Finished difference Result 284 states and 343 transitions. [2025-03-09 02:47:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:47:05,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-03-09 02:47:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:05,674 INFO L225 Difference]: With dead ends: 284 [2025-03-09 02:47:05,674 INFO L226 Difference]: Without dead ends: 282 [2025-03-09 02:47:05,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:47:05,675 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 92 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:05,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 404 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 108 Invalid, 4 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:05,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-09 02:47:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 257. [2025-03-09 02:47:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.489010989010989) internal successors, (271), 230 states have internal predecessors, (271), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:47:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 317 transitions. [2025-03-09 02:47:05,684 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 317 transitions. Word has length 64 [2025-03-09 02:47:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:05,684 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 317 transitions. [2025-03-09 02:47:05,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 317 transitions. [2025-03-09 02:47:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:47:05,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:05,685 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:05,692 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-09 02:47:05,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:05,885 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_28_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 268380858, now seen corresponding path program 1 times [2025-03-09 02:47:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560331230] [2025-03-09 02:47:05,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:05,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:47:05,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:47:05,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:05,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 02:47:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:05,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560331230] [2025-03-09 02:47:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560331230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:05,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539909177] [2025-03-09 02:47:05,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:05,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:05,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:05,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:05,951 INFO L87 Difference]: Start difference. First operand 257 states and 317 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:06,012 INFO L93 Difference]: Finished difference Result 257 states and 317 transitions. [2025-03-09 02:47:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:06,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2025-03-09 02:47:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:06,013 INFO L225 Difference]: With dead ends: 257 [2025-03-09 02:47:06,013 INFO L226 Difference]: Without dead ends: 256 [2025-03-09 02:47:06,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:06,015 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 52 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:06,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 369 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-09 02:47:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-09 02:47:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 182 states have (on average 1.4725274725274726) internal successors, (268), 229 states have internal predecessors, (268), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:47:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 314 transitions. [2025-03-09 02:47:06,025 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 314 transitions. Word has length 66 [2025-03-09 02:47:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:06,025 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 314 transitions. [2025-03-09 02:47:06,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 314 transitions. [2025-03-09 02:47:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 02:47:06,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:06,026 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:06,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 02:47:06,026 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_28_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:06,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash -270127971, now seen corresponding path program 1 times [2025-03-09 02:47:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:06,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472544863] [2025-03-09 02:47:06,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:06,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:06,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 02:47:06,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:47:06,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:06,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 02:47:06,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:06,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472544863] [2025-03-09 02:47:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472544863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:06,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:06,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:06,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258813067] [2025-03-09 02:47:06,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:06,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:06,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:06,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:06,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:06,084 INFO L87 Difference]: Start difference. First operand 256 states and 314 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:06,148 INFO L93 Difference]: Finished difference Result 256 states and 314 transitions. [2025-03-09 02:47:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:06,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2025-03-09 02:47:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:06,150 INFO L225 Difference]: With dead ends: 256 [2025-03-09 02:47:06,150 INFO L226 Difference]: Without dead ends: 255 [2025-03-09 02:47:06,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:06,150 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 49 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:06,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 464 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-09 02:47:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-09 02:47:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 182 states have (on average 1.456043956043956) internal successors, (265), 228 states have internal predecessors, (265), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:47:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 311 transitions. [2025-03-09 02:47:06,159 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 311 transitions. Word has length 67 [2025-03-09 02:47:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:06,159 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 311 transitions. [2025-03-09 02:47:06,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 311 transitions. [2025-03-09 02:47:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 02:47:06,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:06,160 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:06,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 02:47:06,160 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_28_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:06,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash 215967512, now seen corresponding path program 1 times [2025-03-09 02:47:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674348691] [2025-03-09 02:47:06,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:06,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:47:06,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:47:06,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:06,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 02:47:06,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674348691] [2025-03-09 02:47:06,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674348691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:06,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:06,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:06,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846009035] [2025-03-09 02:47:06,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:06,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:06,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:06,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:06,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:06,227 INFO L87 Difference]: Start difference. First operand 255 states and 311 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:06,294 INFO L93 Difference]: Finished difference Result 255 states and 311 transitions. [2025-03-09 02:47:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:06,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-03-09 02:47:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:06,295 INFO L225 Difference]: With dead ends: 255 [2025-03-09 02:47:06,295 INFO L226 Difference]: Without dead ends: 254 [2025-03-09 02:47:06,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:06,296 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 44 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:06,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 456 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-09 02:47:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-09 02:47:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 182 states have (on average 1.4395604395604396) internal successors, (262), 227 states have internal predecessors, (262), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:47:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 308 transitions. [2025-03-09 02:47:06,305 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 308 transitions. Word has length 68 [2025-03-09 02:47:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:06,305 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 308 transitions. [2025-03-09 02:47:06,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 308 transitions. [2025-03-09 02:47:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:47:06,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:06,305 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:06,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 02:47:06,306 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_28_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:06,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1894941701, now seen corresponding path program 1 times [2025-03-09 02:47:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:06,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643082504] [2025-03-09 02:47:06,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:06,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:47:06,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:47:06,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:06,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 02:47:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643082504] [2025-03-09 02:47:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643082504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:06,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:06,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572812086] [2025-03-09 02:47:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:06,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:06,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:06,363 INFO L87 Difference]: Start difference. First operand 254 states and 308 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:06,430 INFO L93 Difference]: Finished difference Result 254 states and 308 transitions. [2025-03-09 02:47:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:47:06,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2025-03-09 02:47:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:06,431 INFO L225 Difference]: With dead ends: 254 [2025-03-09 02:47:06,431 INFO L226 Difference]: Without dead ends: 253 [2025-03-09 02:47:06,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:06,432 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 41 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 395 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-09 02:47:06,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 395 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-09 02:47:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-09 02:47:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 182 states have (on average 1.4230769230769231) internal successors, (259), 226 states have internal predecessors, (259), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:47:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2025-03-09 02:47:06,442 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 69 [2025-03-09 02:47:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:06,442 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2025-03-09 02:47:06,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:47:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2025-03-09 02:47:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 02:47:06,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:06,443 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:06,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 02:47:06,443 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_28_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:06,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1386349430, now seen corresponding path program 1 times [2025-03-09 02:47:06,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:06,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519619739] [2025-03-09 02:47:06,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:06,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 02:47:06,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 02:47:06,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:06,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:06,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755404271] [2025-03-09 02:47:06,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:06,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:06,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:06,465 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-09 02:47:06,466 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-09 02:47:06,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 02:47:06,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 02:47:06,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:06,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:06,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 02:47:06,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:06,558 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-09 02:47:06,743 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-09 02:47:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:06,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:47:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 02:47:06,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:06,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519619739] [2025-03-09 02:47:06,856 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:06,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755404271] [2025-03-09 02:47:06,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755404271] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:06,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:06,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2025-03-09 02:47:06,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581106842] [2025-03-09 02:47:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:06,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:47:06,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:06,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:47:06,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:47:06,858 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:06,899 INFO L93 Difference]: Finished difference Result 253 states and 305 transitions. [2025-03-09 02:47:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:47:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2025-03-09 02:47:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:06,900 INFO L225 Difference]: With dead ends: 253 [2025-03-09 02:47:06,900 INFO L226 Difference]: Without dead ends: 252 [2025-03-09 02:47:06,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:47:06,902 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 7 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:06,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 324 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-09 02:47:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-09 02:47:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 182 states have (on average 1.4065934065934067) internal successors, (256), 225 states have internal predecessors, (256), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:47:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 302 transitions. [2025-03-09 02:47:06,915 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 302 transitions. Word has length 70 [2025-03-09 02:47:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:06,915 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 302 transitions. [2025-03-09 02:47:06,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:47:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 302 transitions. [2025-03-09 02:47:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-09 02:47:06,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:06,916 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:06,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:47:07,116 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,SelfDestructingSolverStorable25 [2025-03-09 02:47:07,116 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_28_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:07,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash 27159385, now seen corresponding path program 1 times [2025-03-09 02:47:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:07,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524482239] [2025-03-09 02:47:07,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:07,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 02:47:07,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 02:47:07,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:07,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:07,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689304726] [2025-03-09 02:47:07,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:07,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:07,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:07,148 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-09 02:47:07,157 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-09 02:47:07,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 02:47:07,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 02:47:07,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:07,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:07,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 02:47:07,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:07,267 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-09 02:47:07,387 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-09 02:47:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:47:07,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:47:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:47:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524482239] [2025-03-09 02:47:07,704 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689304726] [2025-03-09 02:47:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689304726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:47:07,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:47:07,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2025-03-09 02:47:07,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422349500] [2025-03-09 02:47:07,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:47:07,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:47:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:07,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:47:07,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:47:07,705 INFO L87 Difference]: Start difference. First operand 252 states and 302 transitions. Second operand has 20 states, 17 states have (on average 6.235294117647059) internal successors, (106), 16 states have internal predecessors, (106), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:47:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:08,304 INFO L93 Difference]: Finished difference Result 362 states and 382 transitions. [2025-03-09 02:47:08,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 02:47:08,304 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.235294117647059) internal successors, (106), 16 states have internal predecessors, (106), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 71 [2025-03-09 02:47:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:08,306 INFO L225 Difference]: With dead ends: 362 [2025-03-09 02:47:08,306 INFO L226 Difference]: Without dead ends: 361 [2025-03-09 02:47:08,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:47:08,307 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 415 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:08,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1921 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:47:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-09 02:47:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 270. [2025-03-09 02:47:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 197 states have (on average 1.416243654822335) internal successors, (279), 240 states have internal predecessors, (279), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 22 states have call predecessors, (28), 22 states have call successors, (28) [2025-03-09 02:47:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 329 transitions. [2025-03-09 02:47:08,319 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 329 transitions. Word has length 71 [2025-03-09 02:47:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:08,319 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 329 transitions. [2025-03-09 02:47:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.235294117647059) internal successors, (106), 16 states have internal predecessors, (106), 6 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 02:47:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 329 transitions. [2025-03-09 02:47:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 02:47:08,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:08,321 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:47:08,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:47:08,521 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,SelfDestructingSolverStorable26 [2025-03-09 02:47:08,521 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:08,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 864109875, now seen corresponding path program 1 times [2025-03-09 02:47:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573829117] [2025-03-09 02:47:08,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:08,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 02:47:08,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 02:47:08,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900019699] [2025-03-09 02:47:08,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:08,538 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:08,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:47:08,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 02:47:08,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 02:47:08,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:08,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:08,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:47:08,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:08,624 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-09 02:47:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:47:08,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:08,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573829117] [2025-03-09 02:47:08,716 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900019699] [2025-03-09 02:47:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900019699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:08,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:08,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:08,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606987807] [2025-03-09 02:47:08,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:08,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:08,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:08,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:08,717 INFO L87 Difference]: Start difference. First operand 270 states and 329 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:08,842 INFO L93 Difference]: Finished difference Result 295 states and 353 transitions. [2025-03-09 02:47:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:47:08,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2025-03-09 02:47:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:08,844 INFO L225 Difference]: With dead ends: 295 [2025-03-09 02:47:08,844 INFO L226 Difference]: Without dead ends: 294 [2025-03-09 02:47:08,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:47:08,844 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 113 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:08,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 345 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:08,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-09 02:47:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2025-03-09 02:47:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 199 states have (on average 1.4120603015075377) internal successors, (281), 241 states have internal predecessors, (281), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2025-03-09 02:47:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 331 transitions. [2025-03-09 02:47:08,856 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 331 transitions. Word has length 72 [2025-03-09 02:47:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:08,857 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 331 transitions. [2025-03-09 02:47:08,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 331 transitions. [2025-03-09 02:47:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 02:47:08,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:08,857 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:47:08,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 02:47:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 02:47:09,058 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1017602415, now seen corresponding path program 1 times [2025-03-09 02:47:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912992897] [2025-03-09 02:47:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:09,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 02:47:09,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 02:47:09,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:09,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487408810] [2025-03-09 02:47:09,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:09,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:09,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:09,085 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:09,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:47:09,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 02:47:09,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 02:47:09,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:09,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:09,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:47:09,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:09,173 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-09 02:47:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:47:09,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:09,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:09,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912992897] [2025-03-09 02:47:09,266 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:09,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487408810] [2025-03-09 02:47:09,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487408810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:09,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:09,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:47:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398981737] [2025-03-09 02:47:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:09,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:47:09,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:09,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:47:09,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:47:09,267 INFO L87 Difference]: Start difference. First operand 272 states and 331 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:09,396 INFO L93 Difference]: Finished difference Result 294 states and 352 transitions. [2025-03-09 02:47:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:47:09,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-03-09 02:47:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:09,398 INFO L225 Difference]: With dead ends: 294 [2025-03-09 02:47:09,398 INFO L226 Difference]: Without dead ends: 293 [2025-03-09 02:47:09,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:47:09,398 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 100 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:09,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 402 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-09 02:47:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 273. [2025-03-09 02:47:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 200 states have (on average 1.41) internal successors, (282), 242 states have internal predecessors, (282), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2025-03-09 02:47:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 332 transitions. [2025-03-09 02:47:09,408 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 332 transitions. Word has length 73 [2025-03-09 02:47:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:09,408 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 332 transitions. [2025-03-09 02:47:09,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 332 transitions. [2025-03-09 02:47:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-09 02:47:09,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:09,409 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:47:09,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:47:09,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 02:47:09,613 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:09,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1480903857, now seen corresponding path program 1 times [2025-03-09 02:47:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:09,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239887756] [2025-03-09 02:47:09,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:09,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:09,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 02:47:09,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 02:47:09,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:09,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:47:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239887756] [2025-03-09 02:47:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239887756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571122081] [2025-03-09 02:47:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:09,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:09,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:09,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:09,682 INFO L87 Difference]: Start difference. First operand 273 states and 332 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:09,767 INFO L93 Difference]: Finished difference Result 287 states and 351 transitions. [2025-03-09 02:47:09,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:09,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2025-03-09 02:47:09,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:09,769 INFO L225 Difference]: With dead ends: 287 [2025-03-09 02:47:09,769 INFO L226 Difference]: Without dead ends: 285 [2025-03-09 02:47:09,769 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-09 02:47:09,769 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 39 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:09,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 295 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-09 02:47:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 275. [2025-03-09 02:47:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 202 states have (on average 1.4059405940594059) internal successors, (284), 244 states have internal predecessors, (284), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2025-03-09 02:47:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 334 transitions. [2025-03-09 02:47:09,779 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 334 transitions. Word has length 74 [2025-03-09 02:47:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:09,779 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 334 transitions. [2025-03-09 02:47:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 334 transitions. [2025-03-09 02:47:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 02:47:09,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:09,780 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:47:09,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 02:47:09,780 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:09,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1514433583, now seen corresponding path program 1 times [2025-03-09 02:47:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455527045] [2025-03-09 02:47:09,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:09,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 02:47:09,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 02:47:09,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:09,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:09,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939255081] [2025-03-09 02:47:09,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:09,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:09,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:09,797 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:09,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:47:09,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 02:47:09,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 02:47:09,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:09,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:09,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 02:47:09,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:09,883 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-09 02:47:09,888 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-09 02:47:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:47:10,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:10,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455527045] [2025-03-09 02:47:10,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939255081] [2025-03-09 02:47:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939255081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:10,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:10,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:47:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377456380] [2025-03-09 02:47:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:10,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:47:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:10,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:47:10,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:10,096 INFO L87 Difference]: Start difference. First operand 275 states and 334 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:10,321 INFO L93 Difference]: Finished difference Result 291 states and 349 transitions. [2025-03-09 02:47:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:47:10,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-03-09 02:47:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:10,323 INFO L225 Difference]: With dead ends: 291 [2025-03-09 02:47:10,323 INFO L226 Difference]: Without dead ends: 289 [2025-03-09 02:47:10,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:47:10,324 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 91 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:10,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 447 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 205 Invalid, 3 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-09 02:47:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2025-03-09 02:47:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 204 states have (on average 1.4019607843137254) internal successors, (286), 246 states have internal predecessors, (286), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2025-03-09 02:47:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 336 transitions. [2025-03-09 02:47:10,337 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 336 transitions. Word has length 76 [2025-03-09 02:47:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:10,338 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 336 transitions. [2025-03-09 02:47:10,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 336 transitions. [2025-03-09 02:47:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 02:47:10,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:10,339 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:10,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 02:47:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:10,540 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting func_to_recursive_line_28_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:10,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 121926583, now seen corresponding path program 1 times [2025-03-09 02:47:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:10,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659213920] [2025-03-09 02:47:10,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:10,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:47:10,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:47:10,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:10,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885538658] [2025-03-09 02:47:10,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:10,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:10,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:10,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:10,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:47:10,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:47:10,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:47:10,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:10,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:10,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-09 02:47:10,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:10,664 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-09 02:47:10,667 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-09 02:47:10,853 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-09 02:47:10,874 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-09 02:47:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:47:10,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:47:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659213920] [2025-03-09 02:47:11,034 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885538658] [2025-03-09 02:47:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885538658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:11,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:11,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-09 02:47:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040103005] [2025-03-09 02:47:11,035 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:47:11,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:47:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:11,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:47:11,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:47:11,036 INFO L87 Difference]: Start difference. First operand 277 states and 336 transitions. Second operand has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:11,342 INFO L93 Difference]: Finished difference Result 338 states and 371 transitions. [2025-03-09 02:47:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:47:11,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-09 02:47:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:11,344 INFO L225 Difference]: With dead ends: 338 [2025-03-09 02:47:11,344 INFO L226 Difference]: Without dead ends: 337 [2025-03-09 02:47:11,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:47:11,345 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 259 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:11,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 941 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:47:11,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-09 02:47:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 277. [2025-03-09 02:47:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 204 states have (on average 1.3970588235294117) internal successors, (285), 246 states have internal predecessors, (285), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2025-03-09 02:47:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 335 transitions. [2025-03-09 02:47:11,371 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 335 transitions. Word has length 78 [2025-03-09 02:47:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:11,371 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 335 transitions. [2025-03-09 02:47:11,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:47:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 335 transitions. [2025-03-09 02:47:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 02:47:11,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:11,374 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:11,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 02:47:11,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-09 02:47:11,574 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting func_to_recursive_line_28_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:11,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash -515243214, now seen corresponding path program 1 times [2025-03-09 02:47:11,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:11,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48203538] [2025-03-09 02:47:11,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:11,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:11,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 02:47:11,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 02:47:11,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:11,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:47:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753884253] [2025-03-09 02:47:11,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:11,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:11,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:11,596 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:11,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 02:47:11,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 02:47:11,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 02:47:11,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:11,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:11,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-09 02:47:11,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:11,716 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-09 02:47:11,720 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-09 02:47:12,101 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-09 02:47:12,157 INFO L349 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2025-03-09 02:47:12,157 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 26 treesize of output 29 [2025-03-09 02:47:12,370 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-09 02:47:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:47:12,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:47:12,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:12,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48203538] [2025-03-09 02:47:12,711 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:47:12,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753884253] [2025-03-09 02:47:12,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753884253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:12,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:12,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2025-03-09 02:47:12,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527758318] [2025-03-09 02:47:12,712 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:47:12,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 02:47:12,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:12,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 02:47:12,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:47:12,713 INFO L87 Difference]: Start difference. First operand 277 states and 335 transitions. Second operand has 29 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 02:47:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:13,988 INFO L93 Difference]: Finished difference Result 337 states and 370 transitions. [2025-03-09 02:47:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 02:47:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 79 [2025-03-09 02:47:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:13,991 INFO L225 Difference]: With dead ends: 337 [2025-03-09 02:47:13,992 INFO L226 Difference]: Without dead ends: 336 [2025-03-09 02:47:13,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=1713, Unknown=0, NotChecked=0, Total=1980 [2025-03-09 02:47:13,992 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 330 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:13,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1978 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 02:47:13,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-09 02:47:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 277. [2025-03-09 02:47:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 204 states have (on average 1.392156862745098) internal successors, (284), 246 states have internal predecessors, (284), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2025-03-09 02:47:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 334 transitions. [2025-03-09 02:47:14,006 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 334 transitions. Word has length 79 [2025-03-09 02:47:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:14,006 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 334 transitions. [2025-03-09 02:47:14,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 02:47:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 334 transitions. [2025-03-09 02:47:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 02:47:14,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:14,007 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:47:14,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 02:47:14,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:14,209 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:14,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash -623238227, now seen corresponding path program 1 times [2025-03-09 02:47:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:14,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57638301] [2025-03-09 02:47:14,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:14,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:47:14,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:47:14,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:14,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:47:14,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:14,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57638301] [2025-03-09 02:47:14,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57638301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:14,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:47:14,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:47:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833560775] [2025-03-09 02:47:14,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:14,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:14,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:14,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:14,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:47:14,277 INFO L87 Difference]: Start difference. First operand 277 states and 334 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:14,362 INFO L93 Difference]: Finished difference Result 285 states and 345 transitions. [2025-03-09 02:47:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:14,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2025-03-09 02:47:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:14,363 INFO L225 Difference]: With dead ends: 285 [2025-03-09 02:47:14,363 INFO L226 Difference]: Without dead ends: 283 [2025-03-09 02:47:14,363 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-09 02:47:14,363 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 29 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:14,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 311 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:47:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-09 02:47:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2025-03-09 02:47:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 206 states have (on average 1.3883495145631068) internal successors, (286), 248 states have internal predecessors, (286), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2025-03-09 02:47:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 336 transitions. [2025-03-09 02:47:14,374 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 336 transitions. Word has length 78 [2025-03-09 02:47:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:14,375 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 336 transitions. [2025-03-09 02:47:14,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:47:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 336 transitions. [2025-03-09 02:47:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 02:47:14,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:14,375 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-03-09 02:47:14,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-09 02:47:14,375 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting func_to_recursive_line_28_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:47:14,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1207329557, now seen corresponding path program 1 times [2025-03-09 02:47:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:14,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908180496] [2025-03-09 02:47:14,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:14,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:14,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:47:14,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:47:14,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:14,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:47:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:14,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908180496] [2025-03-09 02:47:14,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908180496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:14,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171471102] [2025-03-09 02:47:14,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:14,682 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:14,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 02:47:14,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:47:14,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:47:14,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:14,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:14,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-09 02:47:14,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:14,787 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-09 02:47:14,791 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-09 02:47:14,835 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-09 02:47:15,225 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-09 02:47:15,291 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-03-09 02:47:15,291 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 43 treesize of output 43 [2025-03-09 02:47:15,440 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-09 02:47:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 47 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:47:15,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:47:15,691 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 30 treesize of output 22 [2025-03-09 02:47:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:47:15,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171471102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:47:15,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:47:15,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 13] total 33 [2025-03-09 02:47:15,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950717483] [2025-03-09 02:47:15,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:47:15,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 02:47:15,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:15,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 02:47:15,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:47:15,748 INFO L87 Difference]: Start difference. First operand 279 states and 336 transitions. Second operand has 34 states, 30 states have (on average 5.166666666666667) internal successors, (155), 28 states have internal predecessors, (155), 10 states have call successors, (20), 9 states have call predecessors, (20), 5 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-09 02:47:19,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:24,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:28,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:32,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:37,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:41,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:45,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:49,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:53,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:47:57,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:48:01,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:48:05,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:48:09,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:48:13,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:48:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:13,242 INFO L93 Difference]: Finished difference Result 336 states and 367 transitions. [2025-03-09 02:48:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 02:48:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 5.166666666666667) internal successors, (155), 28 states have internal predecessors, (155), 10 states have call successors, (20), 9 states have call predecessors, (20), 5 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) Word has length 80 [2025-03-09 02:48:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:13,244 INFO L225 Difference]: With dead ends: 336 [2025-03-09 02:48:13,244 INFO L226 Difference]: Without dead ends: 335 [2025-03-09 02:48:13,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 130 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=2334, Unknown=0, NotChecked=0, Total=2652 [2025-03-09 02:48:13,245 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 495 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 63 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:13,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2149 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1550 Invalid, 14 Unknown, 0 Unchecked, 57.1s Time] [2025-03-09 02:48:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-09 02:48:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 279. [2025-03-09 02:48:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 206 states have (on average 1.383495145631068) internal successors, (285), 248 states have internal predecessors, (285), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (28), 23 states have call predecessors, (28), 22 states have call successors, (28) [2025-03-09 02:48:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 335 transitions. [2025-03-09 02:48:13,259 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 335 transitions. Word has length 80 [2025-03-09 02:48:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:13,259 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 335 transitions. [2025-03-09 02:48:13,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 5.166666666666667) internal successors, (155), 28 states have internal predecessors, (155), 10 states have call successors, (20), 9 states have call predecessors, (20), 5 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-09 02:48:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 335 transitions. [2025-03-09 02:48:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:48:13,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:13,260 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-09 02:48:13,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 02:48:13,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:13,465 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting func_to_recursive_line_28_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-09 02:48:13,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1227489392, now seen corresponding path program 1 times [2025-03-09 02:48:13,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:13,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873417083] [2025-03-09 02:48:13,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:13,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:48:13,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:48:13,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:13,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 02:48:13,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873417083] [2025-03-09 02:48:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873417083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494251849] [2025-03-09 02:48:13,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:13,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:13,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:13,792 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:13,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 02:48:13,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:48:13,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:48:13,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:13,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:13,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-09 02:48:13,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:13,903 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-09 02:48:13,906 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-09 02:48:13,950 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-09 02:48:14,321 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-09 02:48:14,392 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-03-09 02:48:14,392 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 43 treesize of output 43 [2025-03-09 02:48:14,496 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-09 02:48:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:48:14,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:14,733 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 21 [2025-03-09 02:48:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:48:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494251849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:14,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 13] total 33 [2025-03-09 02:48:14,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369125479] [2025-03-09 02:48:14,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:14,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 02:48:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:14,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 02:48:14,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:48:14,793 INFO L87 Difference]: Start difference. First operand 279 states and 335 transitions. Second operand has 34 states, 30 states have (on average 5.233333333333333) internal successors, (157), 28 states have internal predecessors, (157), 10 states have call successors, (20), 9 states have call predecessors, (20), 5 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15)