./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_egcd.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_egcd.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 56632fc3bb2b6db322c5e40eff8fe15b1c7affe1d35304d711252a046867d952 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:31:50,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:31:50,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:31:50,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:31:50,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:31:50,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:31:50,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:31:50,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:31:50,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:31:50,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:31:50,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:31:50,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:31:50,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:31:50,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:31:50,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:31:50,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:31:50,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:31:50,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:31:50,309 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 -> 56632fc3bb2b6db322c5e40eff8fe15b1c7affe1d35304d711252a046867d952 [2025-03-04 11:31:50,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:31:50,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:31:50,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:31:50,564 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:31:50,565 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:31:50,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_egcd.c [2025-03-04 11:31:51,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc9f0a13/97cfea624baa4ec4b3f201f7ac3745d5/FLAG3514bc06c [2025-03-04 11:31:51,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:31:51,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_egcd.c [2025-03-04 11:31:51,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc9f0a13/97cfea624baa4ec4b3f201f7ac3745d5/FLAG3514bc06c [2025-03-04 11:31:52,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc9f0a13/97cfea624baa4ec4b3f201f7ac3745d5 [2025-03-04 11:31:52,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:31:52,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:31:52,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:31:52,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:31:52,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:31:52,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53338b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52, skipping insertion in model container [2025-03-04 11:31:52,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:31:52,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:31:52,413 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:31:52,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:31:52,438 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:31:52,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52 WrapperNode [2025-03-04 11:31:52,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:31:52,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:31:52,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:31:52,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:31:52,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,469 INFO L138 Inliner]: procedures = 16, calls = 114, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 151 [2025-03-04 11:31:52,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:31:52,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:31:52,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:31:52,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:31:52,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,506 INFO L175 MemorySlicer]: Split 73 memory accesses to 10 slices as follows [2, 7, 8, 8, 10, 8, 8, 8, 7, 7]. 14 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0, 0, 0, 0, 0, 0, 0]. The 14 writes are split as follows [0, 0, 2, 2, 2, 2, 2, 2, 1, 1]. [2025-03-04 11:31:52,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:31:52,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:31:52,530 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:31:52,530 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:31:52,531 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (1/1) ... [2025-03-04 11:31:52,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:31:52,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:52,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:31:52,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:31:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:31:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_33_to_48_0 [2025-03-04 11:31:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_33_to_48_0 [2025-03-04 11:31:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:31:52,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:31:52,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:31:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:31:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:31:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:31:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:31:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:31:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 11:31:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 11:31:52,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 11:31:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 11:31:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:31:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:31:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:31:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:31:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:31:52,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:31:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:31:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 11:31:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 11:31:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 11:31:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 11:31:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:31:52,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:31:52,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:31:52,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:31:52,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:31:52,687 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:31:52,689 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:31:53,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L84: 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_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#p~0#1.base, main_~#p~0#1.offset);havoc main_~#p~0#1.base, main_~#p~0#1.offset;call ULTIMATE.dealloc(main_~#q~0#1.base, main_~#q~0#1.offset);havoc main_~#q~0#1.base, main_~#q~0#1.offset;call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset);havoc main_~#r~0#1.base, main_~#r~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_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset; [2025-03-04 11:31:53,081 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live. [2025-03-04 11:31:53,081 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:31:53,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:31:53,093 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:31:53,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:31:53 BoogieIcfgContainer [2025-03-04 11:31:53,094 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:31:53,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:31:53,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:31:53,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:31:53,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:31:52" (1/3) ... [2025-03-04 11:31:53,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aad9570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:31:53, skipping insertion in model container [2025-03-04 11:31:53,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:52" (2/3) ... [2025-03-04 11:31:53,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aad9570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:31:53, skipping insertion in model container [2025-03-04 11:31:53,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:31:53" (3/3) ... [2025-03-04 11:31:53,101 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_egcd.c [2025-03-04 11:31:53,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:31:53,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_egcd.c that has 4 procedures, 154 locations, 1 initial locations, 0 loop locations, and 56 error locations. [2025-03-04 11:31:53,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:31:53,155 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;@473e4c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:31:53,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-04 11:31:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 83 states have (on average 1.7349397590361446) internal successors, (144), 140 states have internal predecessors, (144), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 11:31:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 11:31:53,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:53,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:53,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_33_to_48_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:31:53,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash 325402619, now seen corresponding path program 1 times [2025-03-04 11:31:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:53,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692768628] [2025-03-04 11:31:53,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:53,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:31:53,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:31:53,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:53,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:31:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692768628] [2025-03-04 11:31:53,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692768628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:53,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843899024] [2025-03-04 11:31:53,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:53,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:53,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:53,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:53,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:31:53,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:31:53,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:31:53,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:53,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:53,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:31:53,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:31:53,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:53,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843899024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:53,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:31:53,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359560633] [2025-03-04 11:31:53,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:53,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:31:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:53,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:31:53,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:31:53,505 INFO L87 Difference]: Start difference. First operand has 154 states, 83 states have (on average 1.7349397590361446) internal successors, (144), 140 states have internal predecessors, (144), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:31:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:53,524 INFO L93 Difference]: Finished difference Result 304 states and 338 transitions. [2025-03-04 11:31:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:31:53,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-04 11:31:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:53,529 INFO L225 Difference]: With dead ends: 304 [2025-03-04 11:31:53,529 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 11:31:53,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:31:53,533 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:53,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 11:31:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-04 11:31:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 134 states have internal predecessors, (135), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:31:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2025-03-04 11:31:53,564 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 18 [2025-03-04 11:31:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:53,565 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2025-03-04 11:31:53,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:31:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2025-03-04 11:31:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 11:31:53,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:53,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:53,572 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-04 11:31:53,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:31:53,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_33_to_48_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:31:53,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1562654329, now seen corresponding path program 1 times [2025-03-04 11:31:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:53,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412695000] [2025-03-04 11:31:53,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:53,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:31:53,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:31:53,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:53,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:53,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353489364] [2025-03-04 11:31:53,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:53,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:53,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:53,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:53,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:31:53,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:31:53,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:31:53,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:53,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:53,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 11:31:53,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:53,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:31:53,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:31:54,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:31:54,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:31:54,065 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-04 11:31:54,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:54,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412695000] [2025-03-04 11:31:54,066 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:54,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353489364] [2025-03-04 11:31:54,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353489364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:54,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:54,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:54,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870711155] [2025-03-04 11:31:54,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:54,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:54,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:54,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:54,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:54,067 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-04 11:31:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:54,267 INFO L93 Difference]: Finished difference Result 244 states and 259 transitions. [2025-03-04 11:31:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:54,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 18 [2025-03-04 11:31:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:54,270 INFO L225 Difference]: With dead ends: 244 [2025-03-04 11:31:54,270 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 11:31:54,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:54,271 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 159 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:54,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 659 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 11:31:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 176. [2025-03-04 11:31:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 103 states have (on average 1.7281553398058251) internal successors, (178), 159 states have internal predecessors, (178), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-04 11:31:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2025-03-04 11:31:54,290 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 18 [2025-03-04 11:31:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:54,291 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2025-03-04 11:31:54,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-04 11:31:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2025-03-04 11:31:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:31:54,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:54,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:54,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:31:54,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 11:31:54,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_33_to_48_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:31:54,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:54,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1197643982, now seen corresponding path program 1 times [2025-03-04 11:31:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:54,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-03-04 11:31:54,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:54,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:31:54,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:31:54,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:54,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:54,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860508486] [2025-03-04 11:31:54,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:54,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:54,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:54,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:31:54,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:31:54,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:31:54,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:54,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:54,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 11:31:54,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:54,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:54,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:54,696 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-04 11:31:54,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-03-04 11:31:54,697 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860508486] [2025-03-04 11:31:54,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860508486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:54,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:54,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066479274] [2025-03-04 11:31:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:54,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:54,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:54,698 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-04 11:31:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:54,849 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2025-03-04 11:31:54,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:54,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 19 [2025-03-04 11:31:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:54,851 INFO L225 Difference]: With dead ends: 243 [2025-03-04 11:31:54,851 INFO L226 Difference]: Without dead ends: 242 [2025-03-04 11:31:54,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:54,851 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 156 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:54,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 661 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-04 11:31:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 176. [2025-03-04 11:31:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 103 states have (on average 1.7184466019417475) internal successors, (177), 159 states have internal predecessors, (177), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-04 11:31:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 204 transitions. [2025-03-04 11:31:54,863 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 204 transitions. Word has length 19 [2025-03-04 11:31:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:54,863 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 204 transitions. [2025-03-04 11:31:54,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-04 11:31:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 204 transitions. [2025-03-04 11:31:54,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 11:31:54,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:54,864 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:54,870 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-04 11:31:55,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:55,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_33_to_48_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:31:55,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1527742185, now seen corresponding path program 1 times [2025-03-04 11:31:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:55,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381450872] [2025-03-04 11:31:55,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:55,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:55,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 11:31:55,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 11:31:55,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:55,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:55,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345923651] [2025-03-04 11:31:55,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:55,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:55,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:55,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:55,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:31:55,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 11:31:55,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 11:31:55,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:55,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:55,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:31:55,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:55,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:55,236 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-04 11:31:55,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381450872] [2025-03-04 11:31:55,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345923651] [2025-03-04 11:31:55,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345923651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:55,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:55,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116431696] [2025-03-04 11:31:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:55,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:55,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:55,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:55,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:55,237 INFO L87 Difference]: Start difference. First operand 176 states and 204 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-04 11:31:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:55,389 INFO L93 Difference]: Finished difference Result 290 states and 328 transitions. [2025-03-04 11:31:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:55,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 20 [2025-03-04 11:31:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:55,391 INFO L225 Difference]: With dead ends: 290 [2025-03-04 11:31:55,391 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 11:31:55,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:55,392 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 167 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:55,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 678 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 11:31:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 215. [2025-03-04 11:31:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 136 states have (on average 1.7058823529411764) internal successors, (232), 193 states have internal predecessors, (232), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-03-04 11:31:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2025-03-04 11:31:55,407 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 20 [2025-03-04 11:31:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:55,407 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2025-03-04 11:31:55,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-04 11:31:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2025-03-04 11:31:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 11:31:55,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:55,408 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:55,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:31:55,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:55,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_33_to_48_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:31:55,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash 718576565, now seen corresponding path program 1 times [2025-03-04 11:31:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:55,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038497462] [2025-03-04 11:31:55,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:55,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 11:31:55,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 11:31:55,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:55,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:55,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537790492] [2025-03-04 11:31:55,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:55,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:55,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:55,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:55,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:31:55,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 11:31:55,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 11:31:55,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:55,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:55,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 11:31:55,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:55,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:55,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:55,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:55,854 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-04 11:31:55,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038497462] [2025-03-04 11:31:55,854 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537790492] [2025-03-04 11:31:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537790492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:55,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:55,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151292787] [2025-03-04 11:31:55,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:55,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:55,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:55,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:55,856 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-04 11:31:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:56,037 INFO L93 Difference]: Finished difference Result 275 states and 319 transitions. [2025-03-04 11:31:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:56,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 22 [2025-03-04 11:31:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:56,039 INFO L225 Difference]: With dead ends: 275 [2025-03-04 11:31:56,039 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 11:31:56,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:31:56,040 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 140 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:56,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 765 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 11:31:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 215. [2025-03-04 11:31:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 136 states have (on average 1.6911764705882353) internal successors, (230), 193 states have internal predecessors, (230), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-03-04 11:31:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 268 transitions. [2025-03-04 11:31:56,049 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 268 transitions. Word has length 22 [2025-03-04 11:31:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:56,050 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 268 transitions. [2025-03-04 11:31:56,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-04 11:31:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 268 transitions. [2025-03-04 11:31:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:31:56,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:56,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:56,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:31:56,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:56,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_33_to_48_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:31:56,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1275265278, now seen corresponding path program 1 times [2025-03-04 11:31:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:56,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336842473] [2025-03-04 11:31:56,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:56,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:31:56,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:31:56,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:56,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:56,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833935451] [2025-03-04 11:31:56,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:56,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:56,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:56,297 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:56,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:31:56,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:31:56,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:31:56,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:56,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:56,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 11:31:56,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:56,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:31:56,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:56,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:31:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:31:56,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:56,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336842473] [2025-03-04 11:31:56,581 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833935451] [2025-03-04 11:31:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833935451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:56,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:56,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 11:31:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232267348] [2025-03-04 11:31:56,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:56,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:31:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:56,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:31:56,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:31:56,582 INFO L87 Difference]: Start difference. First operand 215 states and 268 transitions. Second operand has 11 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:31:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:56,880 INFO L93 Difference]: Finished difference Result 387 states and 458 transitions. [2025-03-04 11:31:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:31:56,881 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2025-03-04 11:31:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:56,882 INFO L225 Difference]: With dead ends: 387 [2025-03-04 11:31:56,882 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 11:31:56,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:31:56,883 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 307 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:56,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1064 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 11:31:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 283. [2025-03-04 11:31:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 194 states have (on average 1.7061855670103092) internal successors, (331), 252 states have internal predecessors, (331), 24 states have call successors, (24), 7 states have call predecessors, (24), 9 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2025-03-04 11:31:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 386 transitions. [2025-03-04 11:31:56,900 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 386 transitions. Word has length 30 [2025-03-04 11:31:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:56,900 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 386 transitions. [2025-03-04 11:31:56,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:31:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 386 transitions. [2025-03-04 11:31:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:31:56,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:56,901 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:56,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:57,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:57,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_33_to_48_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:31:57,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash -878517929, now seen corresponding path program 1 times [2025-03-04 11:31:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:57,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117491999] [2025-03-04 11:31:57,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:57,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:31:57,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:31:57,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:57,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:57,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381191422] [2025-03-04 11:31:57,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:57,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:57,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:57,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:57,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:31:57,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:31:57,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:31:57,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:57,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:57,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 11:31:57,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:57,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:31:57,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:57,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:31:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:31:57,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:57,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117491999] [2025-03-04 11:31:57,382 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:57,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381191422] [2025-03-04 11:31:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381191422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:57,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:57,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 11:31:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577193498] [2025-03-04 11:31:57,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:57,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:31:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:57,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:31:57,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:31:57,382 INFO L87 Difference]: Start difference. First operand 283 states and 386 transitions. Second operand has 11 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:31:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:57,695 INFO L93 Difference]: Finished difference Result 386 states and 456 transitions. [2025-03-04 11:31:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:31:57,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2025-03-04 11:31:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:57,697 INFO L225 Difference]: With dead ends: 386 [2025-03-04 11:31:57,697 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 11:31:57,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:31:57,697 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 390 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:57,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 977 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 11:31:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 283. [2025-03-04 11:31:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 194 states have (on average 1.6958762886597938) internal successors, (329), 252 states have internal predecessors, (329), 24 states have call successors, (24), 7 states have call predecessors, (24), 9 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2025-03-04 11:31:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2025-03-04 11:31:57,714 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 384 transitions. Word has length 31 [2025-03-04 11:31:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:57,715 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 384 transitions. [2025-03-04 11:31:57,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:31:57,715 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 384 transitions. [2025-03-04 11:31:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:31:57,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:57,716 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-04 11:31:57,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:57,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:57,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_33_to_48_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:31:57,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252000, now seen corresponding path program 1 times [2025-03-04 11:31:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025758178] [2025-03-04 11:31:57,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:57,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:31:57,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:31:57,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:57,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:57,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013062066] [2025-03-04 11:31:57,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:57,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:57,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:57,942 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:57,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:31:58,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:31:58,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:31:58,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:58,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 11:31:58,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:58,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:31:58,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:31:58,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:31:58,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:31:58,195 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-04 11:31:58,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025758178] [2025-03-04 11:31:58,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013062066] [2025-03-04 11:31:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013062066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:58,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 11:31:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896472388] [2025-03-04 11:31:58,302 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:58,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:31:58,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:58,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:31:58,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:31:58,302 INFO L87 Difference]: Start difference. First operand 283 states and 384 transitions. Second operand has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:32:02,317 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-04 11:32:06,325 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-04 11:32:10,550 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-04 11:32:14,647 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-04 11:32:18,652 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-04 11:32:22,665 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-04 11:32:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:22,731 INFO L93 Difference]: Finished difference Result 387 states and 453 transitions. [2025-03-04 11:32:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:32:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2025-03-04 11:32:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:22,733 INFO L225 Difference]: With dead ends: 387 [2025-03-04 11:32:22,733 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 11:32:22,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:32:22,734 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 357 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 24 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:22,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1149 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 330 Invalid, 6 Unknown, 0 Unchecked, 24.3s Time] [2025-03-04 11:32:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 11:32:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 287. [2025-03-04 11:32:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 197 states have (on average 1.6751269035532994) internal successors, (330), 255 states have internal predecessors, (330), 24 states have call successors, (24), 8 states have call predecessors, (24), 10 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2025-03-04 11:32:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 385 transitions. [2025-03-04 11:32:22,745 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 385 transitions. Word has length 32 [2025-03-04 11:32:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:22,746 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 385 transitions. [2025-03-04 11:32:22,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:32:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 385 transitions. [2025-03-04 11:32:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:32:22,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:22,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:32:22,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:32:22,947 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,SelfDestructingSolverStorable7 [2025-03-04 11:32:22,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_33_to_48_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1852828277, now seen corresponding path program 1 times [2025-03-04 11:32:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:22,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662835381] [2025-03-04 11:32:22,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:22,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:32:22,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:32:22,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:22,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:32:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108488148] [2025-03-04 11:32:22,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:22,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:22,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:32:22,977 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:32:22,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:32:23,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:32:23,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:32:23,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:23,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:23,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 11:32:23,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:32:23,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:23,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:23,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:32:23,248 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-04 11:32:23,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:32:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662835381] [2025-03-04 11:32:23,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:32:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108488148] [2025-03-04 11:32:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108488148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:23,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:23,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:32:23,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676879512] [2025-03-04 11:32:23,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:23,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:32:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:23,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:32:23,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:32:23,250 INFO L87 Difference]: Start difference. First operand 287 states and 385 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:32:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:23,545 INFO L93 Difference]: Finished difference Result 386 states and 451 transitions. [2025-03-04 11:32:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:32:23,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-04 11:32:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:23,547 INFO L225 Difference]: With dead ends: 386 [2025-03-04 11:32:23,547 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 11:32:23,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:32:23,548 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 354 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:23,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 850 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:32:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 11:32:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 287. [2025-03-04 11:32:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 197 states have (on average 1.6649746192893402) internal successors, (328), 255 states have internal predecessors, (328), 24 states have call successors, (24), 8 states have call predecessors, (24), 10 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2025-03-04 11:32:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2025-03-04 11:32:23,566 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 33 [2025-03-04 11:32:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:23,566 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2025-03-04 11:32:23,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:32:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2025-03-04 11:32:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:32:23,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:23,569 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-04 11:32:23,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:32:23,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:23,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_33_to_48_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:23,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1603101758, now seen corresponding path program 1 times [2025-03-04 11:32:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:23,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007716191] [2025-03-04 11:32:23,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:23,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:32:23,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:32:23,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:23,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:32:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397173220] [2025-03-04 11:32:23,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:23,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:23,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:32:23,806 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-04 11:32:23,807 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-04 11:32:23,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:32:23,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:32:23,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:23,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:23,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 11:32:23,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:32:23,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:23,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:23,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:24,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 11:32:24,131 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-04 11:32:24,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:32:24,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007716191] [2025-03-04 11:32:24,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:32:24,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397173220] [2025-03-04 11:32:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397173220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:24,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:24,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 11:32:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840127582] [2025-03-04 11:32:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:24,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:32:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:24,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:32:24,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:32:24,132 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:32:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:24,521 INFO L93 Difference]: Finished difference Result 381 states and 445 transitions. [2025-03-04 11:32:24,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:32:24,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-04 11:32:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:24,523 INFO L225 Difference]: With dead ends: 381 [2025-03-04 11:32:24,523 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 11:32:24,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:32:24,524 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 359 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:24,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 852 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:32:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 11:32:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 287. [2025-03-04 11:32:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 197 states have (on average 1.6548223350253808) internal successors, (326), 255 states have internal predecessors, (326), 24 states have call successors, (24), 8 states have call predecessors, (24), 10 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2025-03-04 11:32:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 381 transitions. [2025-03-04 11:32:24,537 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 381 transitions. Word has length 34 [2025-03-04 11:32:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:24,538 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 381 transitions. [2025-03-04 11:32:24,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:32:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 381 transitions. [2025-03-04 11:32:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:32:24,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:24,538 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] [2025-03-04 11:32:24,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:32:24,743 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,SelfDestructingSolverStorable9 [2025-03-04 11:32:24,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_33_to_48_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:24,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1843453037, now seen corresponding path program 1 times [2025-03-04 11:32:24,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:24,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857106107] [2025-03-04 11:32:24,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:24,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:24,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:32:24,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:32:24,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:24,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:32:24,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245645958] [2025-03-04 11:32:24,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:24,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:24,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:32:24,764 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-04 11:32:24,765 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-04 11:32:24,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:32:24,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:32:24,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:24,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:24,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 11:32:24,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:32:24,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:24,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-04 11:32:24,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:25,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:32:25,040 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-04 11:32:25,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:32:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857106107] [2025-03-04 11:32:25,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:32:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245645958] [2025-03-04 11:32:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245645958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:25,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:25,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 11:32:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058366644] [2025-03-04 11:32:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:25,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:32:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:25,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:32:25,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:32:25,041 INFO L87 Difference]: Start difference. First operand 287 states and 381 transitions. Second operand has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:32:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:25,402 INFO L93 Difference]: Finished difference Result 380 states and 443 transitions. [2025-03-04 11:32:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:32:25,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-03-04 11:32:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:25,404 INFO L225 Difference]: With dead ends: 380 [2025-03-04 11:32:25,404 INFO L226 Difference]: Without dead ends: 379 [2025-03-04 11:32:25,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:32:25,405 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 355 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:25,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 918 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:32:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-04 11:32:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 287. [2025-03-04 11:32:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 197 states have (on average 1.6446700507614214) internal successors, (324), 255 states have internal predecessors, (324), 24 states have call successors, (24), 8 states have call predecessors, (24), 10 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2025-03-04 11:32:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 379 transitions. [2025-03-04 11:32:25,417 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 379 transitions. Word has length 35 [2025-03-04 11:32:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:25,417 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 379 transitions. [2025-03-04 11:32:25,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:32:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 379 transitions. [2025-03-04 11:32:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:32:25,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:25,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:32:25,424 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-04 11:32:25,618 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,SelfDestructingSolverStorable10 [2025-03-04 11:32:25,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_33_to_48_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1743796885, now seen corresponding path program 1 times [2025-03-04 11:32:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400845113] [2025-03-04 11:32:25,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:25,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:32:25,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:32:25,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:25,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:32:25,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567328052] [2025-03-04 11:32:25,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:25,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:25,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:32:25,644 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-04 11:32:25,645 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-04 11:32:25,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:32:25,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:32:25,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:25,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:32:25,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:32:25,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:32:25,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:32:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400845113] [2025-03-04 11:32:25,815 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:32:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567328052] [2025-03-04 11:32:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567328052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:25,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:25,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:32:25,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573002213] [2025-03-04 11:32:25,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:25,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:32:25,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:25,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:32:25,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:32:25,816 INFO L87 Difference]: Start difference. First operand 287 states and 379 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:32:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:25,932 INFO L93 Difference]: Finished difference Result 433 states and 511 transitions. [2025-03-04 11:32:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:32:25,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-03-04 11:32:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:25,935 INFO L225 Difference]: With dead ends: 433 [2025-03-04 11:32:25,935 INFO L226 Difference]: Without dead ends: 431 [2025-03-04 11:32:25,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:32:25,936 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 310 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:25,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 642 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:32:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-04 11:32:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 343. [2025-03-04 11:32:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.6489795918367347) internal successors, (404), 303 states have internal predecessors, (404), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-04 11:32:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 471 transitions. [2025-03-04 11:32:25,954 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 471 transitions. Word has length 42 [2025-03-04 11:32:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:25,954 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 471 transitions. [2025-03-04 11:32:25,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:32:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 471 transitions. [2025-03-04 11:32:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:32:25,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:25,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:32:25,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:32:26,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 11:32:26,156 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_33_to_48_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:26,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash 751561395, now seen corresponding path program 1 times [2025-03-04 11:32:26,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:26,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754897429] [2025-03-04 11:32:26,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:26,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:32:26,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:32:26,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:26,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:32:26,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291520820] [2025-03-04 11:32:26,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:26,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:26,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:32:26,178 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-04 11:32:26,180 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-04 11:32:26,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:32:26,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:32:26,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:26,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:26,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 11:32:26,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:32:26,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:26,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:26,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:32:26,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:32:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:32:26,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:32:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754897429] [2025-03-04 11:32:26,484 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:32:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291520820] [2025-03-04 11:32:26,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291520820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:26,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:26,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 11:32:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171767313] [2025-03-04 11:32:26,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:26,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:32:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:26,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:32:26,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:32:26,485 INFO L87 Difference]: Start difference. First operand 343 states and 471 transitions. Second operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:32:30,494 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-04 11:32:34,662 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-04 11:32:38,721 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-04 11:32:42,726 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-04 11:32:46,732 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-04 11:32:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:46,797 INFO L93 Difference]: Finished difference Result 441 states and 519 transitions. [2025-03-04 11:32:46,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:32:46,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2025-03-04 11:32:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:46,799 INFO L225 Difference]: With dead ends: 441 [2025-03-04 11:32:46,799 INFO L226 Difference]: Without dead ends: 440 [2025-03-04 11:32:46,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:32:46,800 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 264 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 19 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:46,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1195 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 307 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-03-04 11:32:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-04 11:32:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 343. [2025-03-04 11:32:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 303 states have internal predecessors, (402), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-04 11:32:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 469 transitions. [2025-03-04 11:32:46,815 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 469 transitions. Word has length 44 [2025-03-04 11:32:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:46,816 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 469 transitions. [2025-03-04 11:32:46,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:32:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 469 transitions. [2025-03-04 11:32:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:32:46,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:46,816 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:32:46,823 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-04 11:32:47,017 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,SelfDestructingSolverStorable12 [2025-03-04 11:32:47,017 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_33_to_48_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:47,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1823566772, now seen corresponding path program 1 times [2025-03-04 11:32:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:47,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296346890] [2025-03-04 11:32:47,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:47,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:32:47,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:32:47,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:47,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:32:47,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67768399] [2025-03-04 11:32:47,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:47,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:47,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:32:47,041 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-04 11:32:47,042 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-04 11:32:47,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:32:47,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:32:47,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:47,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:47,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 11:32:47,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:32:47,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:47,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:47,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 11:32:47,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 11:32:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:32:47,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:32:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296346890] [2025-03-04 11:32:47,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:32:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67768399] [2025-03-04 11:32:47,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67768399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:47,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:47,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 11:32:47,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224476417] [2025-03-04 11:32:47,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:47,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:32:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:47,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:32:47,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:32:47,534 INFO L87 Difference]: Start difference. First operand 343 states and 469 transitions. Second operand has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:32:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:47,981 INFO L93 Difference]: Finished difference Result 440 states and 517 transitions. [2025-03-04 11:32:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:32:47,983 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2025-03-04 11:32:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:47,984 INFO L225 Difference]: With dead ends: 440 [2025-03-04 11:32:47,984 INFO L226 Difference]: Without dead ends: 439 [2025-03-04 11:32:47,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:32:47,985 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 500 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:47,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1008 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:32:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-04 11:32:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 343. [2025-03-04 11:32:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.6326530612244898) internal successors, (400), 303 states have internal predecessors, (400), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-04 11:32:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 467 transitions. [2025-03-04 11:32:48,007 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 467 transitions. Word has length 45 [2025-03-04 11:32:48,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:48,008 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 467 transitions. [2025-03-04 11:32:48,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:32:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 467 transitions. [2025-03-04 11:32:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:32:48,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:48,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:32:48,016 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-04 11:32:48,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:48,209 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_33_to_48_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:48,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash 695995089, now seen corresponding path program 1 times [2025-03-04 11:32:48,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:48,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883284447] [2025-03-04 11:32:48,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:48,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:48,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:32:48,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:32:48,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:48,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:32:48,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353300280] [2025-03-04 11:32:48,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:48,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:48,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:32:48,236 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-04 11:32:48,238 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-04 11:32:48,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:32:48,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:32:48,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:48,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:48,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 11:32:48,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:32:48,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:48,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:48,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:48,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 11:32:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:32:48,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:32:48,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883284447] [2025-03-04 11:32:48,632 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:32:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353300280] [2025-03-04 11:32:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353300280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:48,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 11:32:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064329174] [2025-03-04 11:32:48,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:48,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:32:48,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:48,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:32:48,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:32:48,633 INFO L87 Difference]: Start difference. First operand 343 states and 467 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:32:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:48,961 INFO L93 Difference]: Finished difference Result 429 states and 503 transitions. [2025-03-04 11:32:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:32:48,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-04 11:32:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:48,963 INFO L225 Difference]: With dead ends: 429 [2025-03-04 11:32:48,963 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 11:32:48,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:32:48,963 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 524 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:48,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 799 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:32:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 11:32:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 343. [2025-03-04 11:32:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 303 states have internal predecessors, (398), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-04 11:32:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 465 transitions. [2025-03-04 11:32:48,989 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 465 transitions. Word has length 46 [2025-03-04 11:32:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:48,989 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 465 transitions. [2025-03-04 11:32:48,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:32:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 465 transitions. [2025-03-04 11:32:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 11:32:48,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:48,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:32:48,997 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-04 11:32:49,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:32:49,190 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_33_to_48_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:49,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash 101011282, now seen corresponding path program 1 times [2025-03-04 11:32:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:49,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444669756] [2025-03-04 11:32:49,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:49,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:49,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:32:49,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:32:49,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:49,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:32:49,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733986434] [2025-03-04 11:32:49,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:49,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:49,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:32:49,211 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-04 11:32:49,213 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-04 11:32:49,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:32:49,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:32:49,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:49,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:49,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 11:32:49,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:32:49,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:49,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:49,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:49,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:32:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:32:49,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:32:49,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:49,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444669756] [2025-03-04 11:32:49,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:32:49,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733986434] [2025-03-04 11:32:49,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733986434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:49,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:49,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 11:32:49,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915114735] [2025-03-04 11:32:49,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:49,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:32:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:49,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:32:49,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:32:49,577 INFO L87 Difference]: Start difference. First operand 343 states and 465 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:32:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:49,878 INFO L93 Difference]: Finished difference Result 428 states and 501 transitions. [2025-03-04 11:32:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:32:49,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-04 11:32:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:49,880 INFO L225 Difference]: With dead ends: 428 [2025-03-04 11:32:49,880 INFO L226 Difference]: Without dead ends: 427 [2025-03-04 11:32:49,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:32:49,881 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 399 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:49,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 864 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:32:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-04 11:32:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 343. [2025-03-04 11:32:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.616326530612245) internal successors, (396), 303 states have internal predecessors, (396), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-04 11:32:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2025-03-04 11:32:49,910 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 47 [2025-03-04 11:32:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:49,910 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2025-03-04 11:32:49,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:32:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2025-03-04 11:32:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:32:49,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:49,911 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] [2025-03-04 11:32:49,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:32:50,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:32:50,112 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_33_to_48_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:50,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash 734390513, now seen corresponding path program 1 times [2025-03-04 11:32:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:50,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378279529] [2025-03-04 11:32:50,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:50,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:32:50,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:32:50,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:50,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:32:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378279529] [2025-03-04 11:32:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378279529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:50,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:32:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194530923] [2025-03-04 11:32:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:50,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:32:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:50,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:32:50,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:32:50,681 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:32:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:50,714 INFO L93 Difference]: Finished difference Result 343 states and 463 transitions. [2025-03-04 11:32:50,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:32:50,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-03-04 11:32:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:50,717 INFO L225 Difference]: With dead ends: 343 [2025-03-04 11:32:50,717 INFO L226 Difference]: Without dead ends: 342 [2025-03-04 11:32:50,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:32:50,717 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:50,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:32:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-04 11:32:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-04 11:32:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 302 states have internal predecessors, (394), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-04 11:32:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 461 transitions. [2025-03-04 11:32:50,744 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 461 transitions. Word has length 56 [2025-03-04 11:32:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:50,744 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 461 transitions. [2025-03-04 11:32:50,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:32:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 461 transitions. [2025-03-04 11:32:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:32:50,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:50,745 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] [2025-03-04 11:32:50,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:32:50,745 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_33_to_48_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:50,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash 734390097, now seen corresponding path program 1 times [2025-03-04 11:32:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:50,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589977421] [2025-03-04 11:32:50,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:50,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:32:50,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:32:50,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:50,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:32:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589977421] [2025-03-04 11:32:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589977421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:51,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:51,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:32:51,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791978928] [2025-03-04 11:32:51,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:51,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:32:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:51,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:32:51,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:32:51,143 INFO L87 Difference]: Start difference. First operand 342 states and 461 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:32:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:51,176 INFO L93 Difference]: Finished difference Result 342 states and 461 transitions. [2025-03-04 11:32:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:32:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-03-04 11:32:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:51,180 INFO L225 Difference]: With dead ends: 342 [2025-03-04 11:32:51,180 INFO L226 Difference]: Without dead ends: 341 [2025-03-04 11:32:51,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:32:51,181 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:51,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 434 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:32:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-04 11:32:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-04 11:32:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 245 states have (on average 1.6) internal successors, (392), 301 states have internal predecessors, (392), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-04 11:32:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 459 transitions. [2025-03-04 11:32:51,197 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 459 transitions. Word has length 56 [2025-03-04 11:32:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:51,197 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 459 transitions. [2025-03-04 11:32:51,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:32:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 459 transitions. [2025-03-04 11:32:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:32:51,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:51,198 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-04 11:32:51,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:32:51,198 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_33_to_48_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:32:51,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1291269415, now seen corresponding path program 1 times [2025-03-04 11:32:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:51,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292878418] [2025-03-04 11:32:51,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:51,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:51,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:32:51,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:32:51,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:51,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:32:51,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292878418] [2025-03-04 11:32:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292878418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:32:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523983313] [2025-03-04 11:32:51,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:32:51,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:51,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:32:51,596 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:32:51,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:32:51,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:32:51,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:32:51,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:32:51,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:51,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 11:32:51,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:32:51,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:51,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 11:32:51,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2025-03-04 11:32:51,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:51,909 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-04 11:32:51,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:32:52,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:32:52,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:32:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:32:52,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:32:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:32:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523983313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:32:52,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:32:52,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 28 [2025-03-04 11:32:52,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468278823] [2025-03-04 11:32:52,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:32:52,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:32:52,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:52,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:32:52,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:32:52,421 INFO L87 Difference]: Start difference. First operand 341 states and 459 transitions. Second operand has 29 states, 22 states have (on average 5.090909090909091) internal successors, (112), 25 states have internal predecessors, (112), 12 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-04 11:32:56,438 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-04 11:33:00,750 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-04 11:33:04,951 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-04 11:33:08,957 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-04 11:33:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:09,044 INFO L93 Difference]: Finished difference Result 400 states and 484 transitions. [2025-03-04 11:33:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 11:33:09,044 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 5.090909090909091) internal successors, (112), 25 states have internal predecessors, (112), 12 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) Word has length 57 [2025-03-04 11:33:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:09,046 INFO L225 Difference]: With dead ends: 400 [2025-03-04 11:33:09,046 INFO L226 Difference]: Without dead ends: 399 [2025-03-04 11:33:09,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 89 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=1284, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:33:09,046 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 891 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 101 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:09,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 1446 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 465 Invalid, 4 Unknown, 0 Unchecked, 16.4s Time] [2025-03-04 11:33:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-04 11:33:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 341. [2025-03-04 11:33:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 245 states have (on average 1.5959183673469388) internal successors, (391), 301 states have internal predecessors, (391), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-04 11:33:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 458 transitions. [2025-03-04 11:33:09,063 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 458 transitions. Word has length 57 [2025-03-04 11:33:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:09,063 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 458 transitions. [2025-03-04 11:33:09,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 5.090909090909091) internal successors, (112), 25 states have internal predecessors, (112), 12 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-04 11:33:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 458 transitions. [2025-03-04 11:33:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:33:09,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:09,064 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-04 11:33:09,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:09,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:09,268 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_33_to_48_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:09,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1291256506, now seen corresponding path program 1 times [2025-03-04 11:33:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:09,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982442332] [2025-03-04 11:33:09,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:09,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:33:09,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:33:09,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:09,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:33:09,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:09,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982442332] [2025-03-04 11:33:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982442332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 11:33:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694296804] [2025-03-04 11:33:09,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:09,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:33:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:09,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:33:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:33:09,622 INFO L87 Difference]: Start difference. First operand 341 states and 458 transitions. Second operand has 11 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:33:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:09,852 INFO L93 Difference]: Finished difference Result 346 states and 463 transitions. [2025-03-04 11:33:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:33:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-03-04 11:33:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:09,854 INFO L225 Difference]: With dead ends: 346 [2025-03-04 11:33:09,854 INFO L226 Difference]: Without dead ends: 345 [2025-03-04 11:33:09,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:33:09,855 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 119 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:09,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1199 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-04 11:33:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2025-03-04 11:33:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 247 states have (on average 1.591093117408907) internal successors, (393), 303 states have internal predecessors, (393), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-04 11:33:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 460 transitions. [2025-03-04 11:33:09,876 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 460 transitions. Word has length 57 [2025-03-04 11:33:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:09,876 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 460 transitions. [2025-03-04 11:33:09,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 11:33:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 460 transitions. [2025-03-04 11:33:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 11:33:09,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:09,877 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, 1] [2025-03-04 11:33:09,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 11:33:09,878 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:09,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1374438675, now seen corresponding path program 1 times [2025-03-04 11:33:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:09,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16466222] [2025-03-04 11:33:09,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:09,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:09,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 11:33:09,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 11:33:09,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:09,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:33:10,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16466222] [2025-03-04 11:33:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16466222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:10,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:33:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088139039] [2025-03-04 11:33:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:10,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:33:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:10,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:33:10,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:10,143 INFO L87 Difference]: Start difference. First operand 343 states and 460 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:33:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:10,353 INFO L93 Difference]: Finished difference Result 347 states and 466 transitions. [2025-03-04 11:33:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:33:10,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2025-03-04 11:33:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:10,355 INFO L225 Difference]: With dead ends: 347 [2025-03-04 11:33:10,355 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 11:33:10,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:10,356 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 79 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:10,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 650 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 11:33:10,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-04 11:33:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 248 states have (on average 1.5806451612903225) internal successors, (392), 305 states have internal predecessors, (392), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-04 11:33:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 464 transitions. [2025-03-04 11:33:10,384 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 464 transitions. Word has length 58 [2025-03-04 11:33:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:10,385 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 464 transitions. [2025-03-04 11:33:10,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:33:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 464 transitions. [2025-03-04 11:33:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 11:33:10,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:10,385 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, 1] [2025-03-04 11:33:10,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:33:10,386 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_33_to_48_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1374646191, now seen corresponding path program 1 times [2025-03-04 11:33:10,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:10,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532897569] [2025-03-04 11:33:10,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:10,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 11:33:10,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 11:33:10,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:10,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:33:10,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532897569] [2025-03-04 11:33:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532897569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:10,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:10,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317188764] [2025-03-04 11:33:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:10,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:10,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:10,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:10,601 INFO L87 Difference]: Start difference. First operand 346 states and 464 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:33:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:10,729 INFO L93 Difference]: Finished difference Result 367 states and 474 transitions. [2025-03-04 11:33:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:10,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-04 11:33:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:10,732 INFO L225 Difference]: With dead ends: 367 [2025-03-04 11:33:10,732 INFO L226 Difference]: Without dead ends: 365 [2025-03-04 11:33:10,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:10,733 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 72 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:10,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 662 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-04 11:33:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 350. [2025-03-04 11:33:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.5714285714285714) internal successors, (396), 309 states have internal predecessors, (396), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-04 11:33:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 468 transitions. [2025-03-04 11:33:10,754 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 468 transitions. Word has length 58 [2025-03-04 11:33:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:10,754 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 468 transitions. [2025-03-04 11:33:10,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:33:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 468 transitions. [2025-03-04 11:33:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 11:33:10,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:10,755 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, 1] [2025-03-04 11:33:10,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:33:10,755 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_33_to_48_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:10,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:10,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1374245999, now seen corresponding path program 1 times [2025-03-04 11:33:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163772037] [2025-03-04 11:33:10,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:10,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 11:33:10,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 11:33:10,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:10,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:33:10,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163772037] [2025-03-04 11:33:10,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163772037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:10,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:10,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:10,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478225455] [2025-03-04 11:33:10,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:10,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:10,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:10,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:10,959 INFO L87 Difference]: Start difference. First operand 350 states and 468 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:33:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:11,110 INFO L93 Difference]: Finished difference Result 385 states and 478 transitions. [2025-03-04 11:33:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:11,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-04 11:33:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:11,112 INFO L225 Difference]: With dead ends: 385 [2025-03-04 11:33:11,112 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 11:33:11,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:11,112 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 105 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:11,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 685 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 11:33:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 350. [2025-03-04 11:33:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.5634920634920635) internal successors, (394), 309 states have internal predecessors, (394), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-04 11:33:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 466 transitions. [2025-03-04 11:33:11,132 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 466 transitions. Word has length 58 [2025-03-04 11:33:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:11,133 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 466 transitions. [2025-03-04 11:33:11,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:33:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 466 transitions. [2025-03-04 11:33:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 11:33:11,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:11,134 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, 1, 1] [2025-03-04 11:33:11,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 11:33:11,134 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:11,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash -342073925, now seen corresponding path program 1 times [2025-03-04 11:33:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:11,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607328968] [2025-03-04 11:33:11,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:11,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:33:11,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:33:11,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:11,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:33:11,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:11,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607328968] [2025-03-04 11:33:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607328968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:11,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:11,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:33:11,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696904392] [2025-03-04 11:33:11,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:11,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:33:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:11,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:33:11,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:11,393 INFO L87 Difference]: Start difference. First operand 350 states and 466 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:33:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:11,643 INFO L93 Difference]: Finished difference Result 351 states and 466 transitions. [2025-03-04 11:33:11,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:33:11,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2025-03-04 11:33:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:11,645 INFO L225 Difference]: With dead ends: 351 [2025-03-04 11:33:11,645 INFO L226 Difference]: Without dead ends: 350 [2025-03-04 11:33:11,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:11,645 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:11,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 717 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-04 11:33:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-03-04 11:33:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.5555555555555556) internal successors, (392), 309 states have internal predecessors, (392), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-04 11:33:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 464 transitions. [2025-03-04 11:33:11,665 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 464 transitions. Word has length 59 [2025-03-04 11:33:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:11,665 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 464 transitions. [2025-03-04 11:33:11,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:33:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 464 transitions. [2025-03-04 11:33:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 11:33:11,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:11,666 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, 1, 1, 1] [2025-03-04 11:33:11,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 11:33:11,666 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_33_to_48_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:11,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1814938003, now seen corresponding path program 1 times [2025-03-04 11:33:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:11,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75744250] [2025-03-04 11:33:11,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:11,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 11:33:11,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 11:33:11,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:11,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:33:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75744250] [2025-03-04 11:33:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75744250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:11,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:11,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:11,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139641333] [2025-03-04 11:33:11,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:11,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:11,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:11,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:11,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:11,875 INFO L87 Difference]: Start difference. First operand 350 states and 464 transitions. Second operand has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:33:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:12,021 INFO L93 Difference]: Finished difference Result 391 states and 484 transitions. [2025-03-04 11:33:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:12,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-03-04 11:33:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:12,023 INFO L225 Difference]: With dead ends: 391 [2025-03-04 11:33:12,023 INFO L226 Difference]: Without dead ends: 389 [2025-03-04 11:33:12,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:12,024 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 108 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:12,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 657 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-04 11:33:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 350. [2025-03-04 11:33:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.5476190476190477) internal successors, (390), 309 states have internal predecessors, (390), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-04 11:33:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 462 transitions. [2025-03-04 11:33:12,047 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 462 transitions. Word has length 60 [2025-03-04 11:33:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:12,048 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 462 transitions. [2025-03-04 11:33:12,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:33:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 462 transitions. [2025-03-04 11:33:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 11:33:12,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:12,049 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, 1, 1, 1] [2025-03-04 11:33:12,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 11:33:12,050 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:12,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2095444365, now seen corresponding path program 1 times [2025-03-04 11:33:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72440944] [2025-03-04 11:33:12,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:12,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 11:33:12,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 11:33:12,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:12,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:33:12,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:12,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72440944] [2025-03-04 11:33:12,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72440944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:12,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:12,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064325835] [2025-03-04 11:33:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:12,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:12,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:12,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:12,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:12,266 INFO L87 Difference]: Start difference. First operand 350 states and 462 transitions. Second operand has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:33:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:12,394 INFO L93 Difference]: Finished difference Result 366 states and 470 transitions. [2025-03-04 11:33:12,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:12,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-03-04 11:33:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:12,396 INFO L225 Difference]: With dead ends: 366 [2025-03-04 11:33:12,396 INFO L226 Difference]: Without dead ends: 364 [2025-03-04 11:33:12,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:12,396 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 69 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:12,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 664 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-04 11:33:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 354. [2025-03-04 11:33:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 256 states have (on average 1.5390625) internal successors, (394), 313 states have internal predecessors, (394), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-04 11:33:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 466 transitions. [2025-03-04 11:33:12,416 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 466 transitions. Word has length 60 [2025-03-04 11:33:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:12,416 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 466 transitions. [2025-03-04 11:33:12,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:33:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 466 transitions. [2025-03-04 11:33:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:33:12,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:12,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:12,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 11:33:12,417 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_33_to_48_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:12,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:12,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2059495475, now seen corresponding path program 1 times [2025-03-04 11:33:12,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:12,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465662280] [2025-03-04 11:33:12,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:12,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:33:12,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:33:12,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:12,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:12,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [638025004] [2025-03-04 11:33:12,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:12,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:12,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:12,448 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:12,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:33:12,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:33:12,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:33:12,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:12,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:12,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-04 11:33:12,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:12,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:33:12,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:33:12,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:33:12,924 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 34 treesize of output 11 [2025-03-04 11:33:12,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:33:12,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-04 11:33:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:33:12,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:13,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465662280] [2025-03-04 11:33:13,232 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:13,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638025004] [2025-03-04 11:33:13,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638025004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:13,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:33:13,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 11:33:13,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042178387] [2025-03-04 11:33:13,232 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:13,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:33:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:13,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:33:13,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:33:13,233 INFO L87 Difference]: Start difference. First operand 354 states and 466 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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-04 11:33:17,349 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-04 11:33:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:17,519 INFO L93 Difference]: Finished difference Result 420 states and 492 transitions. [2025-03-04 11:33:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:33:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 65 [2025-03-04 11:33:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:17,521 INFO L225 Difference]: With dead ends: 420 [2025-03-04 11:33:17,521 INFO L226 Difference]: Without dead ends: 419 [2025-03-04 11:33:17,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:33:17,522 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 193 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:17,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 909 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 11:33:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-04 11:33:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 354. [2025-03-04 11:33:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 256 states have (on average 1.53515625) internal successors, (393), 313 states have internal predecessors, (393), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-04 11:33:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 465 transitions. [2025-03-04 11:33:17,542 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 465 transitions. Word has length 65 [2025-03-04 11:33:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:17,542 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 465 transitions. [2025-03-04 11:33:17,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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-04 11:33:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 465 transitions. [2025-03-04 11:33:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:33:17,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:17,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:17,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 11:33:17,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:33:17,743 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_33_to_48_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:17,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash -110713056, now seen corresponding path program 1 times [2025-03-04 11:33:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:17,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927059708] [2025-03-04 11:33:17,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:17,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:17,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:33:17,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:33:17,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:17,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:17,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456143740] [2025-03-04 11:33:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:17,776 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:17,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:33:17,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:33:17,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:33:17,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:17,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:17,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-04 11:33:17,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:17,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:33:17,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:33:17,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:33:18,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:33:18,257 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 34 treesize of output 11 [2025-03-04 11:33:18,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:33:18,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:33:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:33:18,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:21,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927059708] [2025-03-04 11:33:21,549 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:21,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456143740] [2025-03-04 11:33:21,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456143740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:21,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:33:21,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 11:33:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013526188] [2025-03-04 11:33:21,549 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:21,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:33:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:21,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:33:21,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=168, Unknown=1, NotChecked=0, Total=210 [2025-03-04 11:33:21,550 INFO L87 Difference]: Start difference. First operand 354 states and 465 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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-04 11:33:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:21,865 INFO L93 Difference]: Finished difference Result 425 states and 497 transitions. [2025-03-04 11:33:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:33:21,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 65 [2025-03-04 11:33:21,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:21,867 INFO L225 Difference]: With dead ends: 425 [2025-03-04 11:33:21,867 INFO L226 Difference]: Without dead ends: 424 [2025-03-04 11:33:21,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=86, Invalid=255, Unknown=1, NotChecked=0, Total=342 [2025-03-04 11:33:21,868 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 204 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:21,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1112 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-04 11:33:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 354. [2025-03-04 11:33:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 256 states have (on average 1.53125) internal successors, (392), 313 states have internal predecessors, (392), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-04 11:33:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 464 transitions. [2025-03-04 11:33:21,888 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 464 transitions. Word has length 65 [2025-03-04 11:33:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:21,889 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 464 transitions. [2025-03-04 11:33:21,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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-04 11:33:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 464 transitions. [2025-03-04 11:33:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:33:21,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:21,890 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:21,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:22,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:22,094 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-04 11:33:22,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 673924385, now seen corresponding path program 1 times [2025-03-04 11:33:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654521045] [2025-03-04 11:33:22,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:22,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:33:22,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:33:22,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:22,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:22,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072349766] [2025-03-04 11:33:22,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:22,116 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:22,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:33:22,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:33:22,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:33:22,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:22,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:22,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 11:33:22,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:22,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:33:22,284 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-04 11:33:22,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 11:33:22,292 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 11 [2025-03-04 11:33:22,310 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 11 treesize of output 7 [2025-03-04 11:33:22,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-04 11:33:22,444 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 19 treesize of output 11 [2025-03-04 11:33:22,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:33:22,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 11:33:22,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2025-03-04 11:33:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:33:22,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654521045] [2025-03-04 11:33:22,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072349766] [2025-03-04 11:33:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072349766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 11:33:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995937606] [2025-03-04 11:33:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:22,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:33:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:22,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:33:22,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:33:22,579 INFO L87 Difference]: Start difference. First operand 354 states and 464 transitions. Second operand has 14 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:33:26,877 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]