./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps6-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps6-ll.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 2b375ae29a973823eea93f22f40d893acb563fa864c4860e04525925a120d938 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:46:15,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:46:15,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:46:15,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:46:15,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:46:15,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:46:15,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:46:15,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:46:15,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:46:15,544 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:46:15,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:46:15,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:46:15,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:46:15,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:46:15,545 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:46:15,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:46:15,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:46:15,546 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:46:15,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:46:15,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:46:15,547 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:46:15,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:46:15,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:46:15,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:46:15,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:46:15,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:46:15,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:46:15,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:46:15,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:46:15,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:46:15,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:46:15,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:46:15,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:46:15,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:46:15,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:46:15,549 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 -> 2b375ae29a973823eea93f22f40d893acb563fa864c4860e04525925a120d938 [2025-03-09 02:46:15,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:46:15,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:46:15,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:46:15,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:46:15,785 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:46:15,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps6-ll.c [2025-03-09 02:46:16,950 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab9ba444/e1e7efb8c53c4d87bf5210c91f404a70/FLAG2e2600aae [2025-03-09 02:46:17,164 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:46:17,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps6-ll.c [2025-03-09 02:46:17,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab9ba444/e1e7efb8c53c4d87bf5210c91f404a70/FLAG2e2600aae [2025-03-09 02:46:17,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab9ba444/e1e7efb8c53c4d87bf5210c91f404a70 [2025-03-09 02:46:17,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:46:17,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:46:17,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:46:17,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:46:17,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:46:17,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a6b2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17, skipping insertion in model container [2025-03-09 02:46:17,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:46:17,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:46:17,673 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:46:17,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:46:17,711 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:46:17,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17 WrapperNode [2025-03-09 02:46:17,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:46:17,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:46:17,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:46:17,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:46:17,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,737 INFO L138 Inliner]: procedures = 16, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 143 [2025-03-09 02:46:17,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:46:17,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:46:17,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:46:17,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:46:17,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,757 INFO L175 MemorySlicer]: Split 60 memory accesses to 5 slices as follows [2, 4, 4, 5, 45]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 2, 2, 2]. [2025-03-09 02:46:17,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:46:17,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:46:17,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:46:17,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:46:17,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (1/1) ... [2025-03-09 02:46:17,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:46:17,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:17,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:46:17,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:46:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:46:17,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:46:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:46:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:46:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:46:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:46:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:46:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:46:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:46:17,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:46:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:46:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:46:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:46:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:46:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:46:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:46:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:46:17,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:46:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:46:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:46:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:46:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_35_0 [2025-03-09 02:46:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_35_0 [2025-03-09 02:46:17,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:46:17,905 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:46:17,907 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:46:18,250 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#k~0#1.base, main_~#k~0#1.offset);havoc main_~#k~0#1.base, main_~#k~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-09 02:46:18,556 INFO L? ?]: Removed 502 outVars from TransFormulas that were not future-live. [2025-03-09 02:46:18,556 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:46:18,570 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:46:18,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:46:18,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:46:18 BoogieIcfgContainer [2025-03-09 02:46:18,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:46:18,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:46:18,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:46:18,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:46:18,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:46:17" (1/3) ... [2025-03-09 02:46:18,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa1a9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:18, skipping insertion in model container [2025-03-09 02:46:18,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:17" (2/3) ... [2025-03-09 02:46:18,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa1a9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:18, skipping insertion in model container [2025-03-09 02:46:18,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:46:18" (3/3) ... [2025-03-09 02:46:18,582 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps6-ll.c [2025-03-09 02:46:18,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:46:18,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps6-ll.c that has 3 procedures, 231 locations, 1 initial locations, 0 loop locations, and 102 error locations. [2025-03-09 02:46:18,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:46:18,649 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;@261b31bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:46:18,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-03-09 02:46:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 121 states have (on average 1.8760330578512396) internal successors, (227), 224 states have internal predecessors, (227), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:46:18,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:46:18,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:18,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:18,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_27_to_35_0Err55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:18,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:18,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1630937752, now seen corresponding path program 1 times [2025-03-09 02:46:18,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:18,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267850331] [2025-03-09 02:46:18,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:18,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:18,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:46:18,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:46:18,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:18,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:18,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:18,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267850331] [2025-03-09 02:46:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267850331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:46:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109274354] [2025-03-09 02:46:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:46:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:18,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:46:18,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:46:18,856 INFO L87 Difference]: Start difference. First operand has 231 states, 121 states have (on average 1.8760330578512396) internal successors, (227), 224 states have internal predecessors, (227), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:18,891 INFO L93 Difference]: Finished difference Result 458 states and 474 transitions. [2025-03-09 02:46:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:46:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 02:46:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:18,900 INFO L225 Difference]: With dead ends: 458 [2025-03-09 02:46:18,901 INFO L226 Difference]: Without dead ends: 224 [2025-03-09 02:46:18,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-09 02:46:18,910 INFO L435 NwaCegarLoop]: 233 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, 233 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-09 02:46:18,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-09 02:46:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-03-09 02:46:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 116 states have (on average 1.8793103448275863) internal successors, (218), 218 states have internal predecessors, (218), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:46:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2025-03-09 02:46:18,943 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 8 [2025-03-09 02:46:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:18,943 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2025-03-09 02:46:18,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2025-03-09 02:46:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:46:18,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:18,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:18,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:46:18,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_27_to_35_0Err55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:18,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1659566903, now seen corresponding path program 1 times [2025-03-09 02:46:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752741317] [2025-03-09 02:46:18,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:18,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:46:18,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:46:18,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:18,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:19,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:19,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752741317] [2025-03-09 02:46:19,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752741317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:19,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:19,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:19,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698844981] [2025-03-09 02:46:19,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:19,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:19,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:19,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:19,172 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:19,565 INFO L93 Difference]: Finished difference Result 414 states and 419 transitions. [2025-03-09 02:46:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:19,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 02:46:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:19,567 INFO L225 Difference]: With dead ends: 414 [2025-03-09 02:46:19,568 INFO L226 Difference]: Without dead ends: 402 [2025-03-09 02:46:19,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:19,569 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 322 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:19,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 848 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:46:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-09 02:46:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 273. [2025-03-09 02:46:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.8159509202453987) internal successors, (296), 265 states have internal predecessors, (296), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 307 transitions. [2025-03-09 02:46:19,587 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 307 transitions. Word has length 8 [2025-03-09 02:46:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:19,587 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 307 transitions. [2025-03-09 02:46:19,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 307 transitions. [2025-03-09 02:46:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:46:19,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:19,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:19,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:46:19,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_35_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:19,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1996935893, now seen corresponding path program 1 times [2025-03-09 02:46:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036283566] [2025-03-09 02:46:19,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:19,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:46:19,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:46:19,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:19,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:19,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:19,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036283566] [2025-03-09 02:46:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036283566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:19,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041128711] [2025-03-09 02:46:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:19,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:19,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:19,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:19,818 INFO L87 Difference]: Start difference. First operand 273 states and 307 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:20,136 INFO L93 Difference]: Finished difference Result 402 states and 407 transitions. [2025-03-09 02:46:20,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:20,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-09 02:46:20,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:20,140 INFO L225 Difference]: With dead ends: 402 [2025-03-09 02:46:20,141 INFO L226 Difference]: Without dead ends: 392 [2025-03-09 02:46:20,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:20,144 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 268 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:20,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 846 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:46:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-09 02:46:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 273. [2025-03-09 02:46:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.7546012269938651) internal successors, (286), 265 states have internal predecessors, (286), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 297 transitions. [2025-03-09 02:46:20,161 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 297 transitions. Word has length 20 [2025-03-09 02:46:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:20,162 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 297 transitions. [2025-03-09 02:46:20,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 297 transitions. [2025-03-09 02:46:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:20,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:20,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:20,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:46:20,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_35_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:20,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash 447393825, now seen corresponding path program 1 times [2025-03-09 02:46:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:20,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067320360] [2025-03-09 02:46:20,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:20,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:20,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:20,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:20,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:20,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739916854] [2025-03-09 02:46:20,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:20,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:20,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:20,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:20,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:46:20,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:20,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:20,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:20,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:20,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:46:20,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:20,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:20,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:20,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067320360] [2025-03-09 02:46:20,454 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739916854] [2025-03-09 02:46:20,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739916854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:20,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190498012] [2025-03-09 02:46:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:20,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:20,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:20,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:20,456 INFO L87 Difference]: Start difference. First operand 273 states and 297 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:20,779 INFO L93 Difference]: Finished difference Result 392 states and 397 transitions. [2025-03-09 02:46:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:20,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-09 02:46:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:20,781 INFO L225 Difference]: With dead ends: 392 [2025-03-09 02:46:20,781 INFO L226 Difference]: Without dead ends: 390 [2025-03-09 02:46:20,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:20,785 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 246 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:20,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1027 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:46:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-09 02:46:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 273. [2025-03-09 02:46:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.7423312883435582) internal successors, (284), 265 states have internal predecessors, (284), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 295 transitions. [2025-03-09 02:46:20,796 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 295 transitions. Word has length 30 [2025-03-09 02:46:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:20,797 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 295 transitions. [2025-03-09 02:46:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 295 transitions. [2025-03-09 02:46:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:46:20,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:20,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:20,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:20,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:20,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_35_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash 448741151, now seen corresponding path program 1 times [2025-03-09 02:46:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179375923] [2025-03-09 02:46:21,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:21,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:46:21,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:46:21,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:21,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:21,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:21,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179375923] [2025-03-09 02:46:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179375923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:21,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:21,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409092544] [2025-03-09 02:46:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:21,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:21,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:21,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:21,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:21,187 INFO L87 Difference]: Start difference. First operand 273 states and 295 transitions. Second operand has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:21,409 INFO L93 Difference]: Finished difference Result 390 states and 395 transitions. [2025-03-09 02:46:21,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:21,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-09 02:46:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:21,410 INFO L225 Difference]: With dead ends: 390 [2025-03-09 02:46:21,411 INFO L226 Difference]: Without dead ends: 382 [2025-03-09 02:46:21,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:21,411 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 216 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:21,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 857 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-09 02:46:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 273. [2025-03-09 02:46:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.6932515337423313) internal successors, (276), 265 states have internal predecessors, (276), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 287 transitions. [2025-03-09 02:46:21,418 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 287 transitions. Word has length 32 [2025-03-09 02:46:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:21,418 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 287 transitions. [2025-03-09 02:46:21,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 287 transitions. [2025-03-09 02:46:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:46:21,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:21,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:21,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:46:21,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_35_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:21,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 733457175, now seen corresponding path program 1 times [2025-03-09 02:46:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257811100] [2025-03-09 02:46:21,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:21,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:46:21,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:46:21,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:21,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:21,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985656712] [2025-03-09 02:46:21,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:21,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:21,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:21,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:21,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:46:21,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:46:21,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:46:21,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:21,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:21,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 02:46:21,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:21,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:21,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:21,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:21,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257811100] [2025-03-09 02:46:21,791 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:21,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985656712] [2025-03-09 02:46:21,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985656712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:21,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:21,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:46:21,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585102550] [2025-03-09 02:46:21,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:21,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:21,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:21,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:21,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:21,792 INFO L87 Difference]: Start difference. First operand 273 states and 287 transitions. Second operand has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:22,106 INFO L93 Difference]: Finished difference Result 382 states and 387 transitions. [2025-03-09 02:46:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-09 02:46:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:22,108 INFO L225 Difference]: With dead ends: 382 [2025-03-09 02:46:22,108 INFO L226 Difference]: Without dead ends: 380 [2025-03-09 02:46:22,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:46:22,109 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 215 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:22,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 862 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:46:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-09 02:46:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 273. [2025-03-09 02:46:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.6809815950920246) internal successors, (274), 265 states have internal predecessors, (274), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 285 transitions. [2025-03-09 02:46:22,117 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 285 transitions. Word has length 40 [2025-03-09 02:46:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:22,117 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 285 transitions. [2025-03-09 02:46:22,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 285 transitions. [2025-03-09 02:46:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 02:46:22,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:22,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:22,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:22,319 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,SelfDestructingSolverStorable5 [2025-03-09 02:46:22,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_35_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:22,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash 477712917, now seen corresponding path program 1 times [2025-03-09 02:46:22,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577845600] [2025-03-09 02:46:22,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:22,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:46:22,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:46:22,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:22,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100062132] [2025-03-09 02:46:22,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:22,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:22,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:22,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:22,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:46:22,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:46:22,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:46:22,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:22,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:22,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:46:22,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:22,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:22,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:22,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:22,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577845600] [2025-03-09 02:46:22,502 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:22,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100062132] [2025-03-09 02:46:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100062132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:22,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:22,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248523916] [2025-03-09 02:46:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:22,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:22,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:22,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:22,503 INFO L87 Difference]: Start difference. First operand 273 states and 285 transitions. Second operand has 6 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:22,700 INFO L93 Difference]: Finished difference Result 380 states and 385 transitions. [2025-03-09 02:46:22,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-09 02:46:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:22,702 INFO L225 Difference]: With dead ends: 380 [2025-03-09 02:46:22,702 INFO L226 Difference]: Without dead ends: 378 [2025-03-09 02:46:22,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:22,703 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 186 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:22,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 881 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-09 02:46:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 273. [2025-03-09 02:46:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.6687116564417177) internal successors, (272), 265 states have internal predecessors, (272), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 283 transitions. [2025-03-09 02:46:22,710 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 283 transitions. Word has length 42 [2025-03-09 02:46:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:22,710 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 283 transitions. [2025-03-09 02:46:22,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 283 transitions. [2025-03-09 02:46:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:46:22,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:22,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:22,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:46:22,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:22,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_27_to_35_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:22,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash -479383277, now seen corresponding path program 1 times [2025-03-09 02:46:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308016548] [2025-03-09 02:46:22,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:22,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:22,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:46:22,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:46:22,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:22,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:22,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110029425] [2025-03-09 02:46:22,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:22,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:22,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:22,936 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:22,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:46:22,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:46:23,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:46:23,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:23,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:23,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 02:46:23,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:23,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:23,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:23,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:23,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308016548] [2025-03-09 02:46:23,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:23,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110029425] [2025-03-09 02:46:23,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110029425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:23,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:23,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:46:23,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207821628] [2025-03-09 02:46:23,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:23,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:46:23,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:23,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:46:23,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:23,279 INFO L87 Difference]: Start difference. First operand 273 states and 283 transitions. Second operand has 8 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:23,859 INFO L93 Difference]: Finished difference Result 378 states and 383 transitions. [2025-03-09 02:46:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:23,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-09 02:46:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:23,861 INFO L225 Difference]: With dead ends: 378 [2025-03-09 02:46:23,861 INFO L226 Difference]: Without dead ends: 377 [2025-03-09 02:46:23,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:46:23,862 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 193 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:23,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 967 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:46:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-09 02:46:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 273. [2025-03-09 02:46:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.6625766871165644) internal successors, (271), 265 states have internal predecessors, (271), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 282 transitions. [2025-03-09 02:46:23,870 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 282 transitions. Word has length 44 [2025-03-09 02:46:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:23,871 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 282 transitions. [2025-03-09 02:46:23,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 282 transitions. [2025-03-09 02:46:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:46:23,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:23,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:23,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:24,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:24,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_27_to_35_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:24,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1975979573, now seen corresponding path program 1 times [2025-03-09 02:46:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234242131] [2025-03-09 02:46:24,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:46:24,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:46:24,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:24,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482446154] [2025-03-09 02:46:24,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:24,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:24,106 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:24,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:46:24,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:46:24,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:46:24,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:24,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:24,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 02:46:24,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:24,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:24,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:24,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234242131] [2025-03-09 02:46:24,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482446154] [2025-03-09 02:46:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482446154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:24,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:46:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797853475] [2025-03-09 02:46:24,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:24,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:46:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:24,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:46:24,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:24,376 INFO L87 Difference]: Start difference. First operand 273 states and 282 transitions. Second operand has 8 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:25,183 INFO L93 Difference]: Finished difference Result 377 states and 382 transitions. [2025-03-09 02:46:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:25,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-09 02:46:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:25,186 INFO L225 Difference]: With dead ends: 377 [2025-03-09 02:46:25,186 INFO L226 Difference]: Without dead ends: 376 [2025-03-09 02:46:25,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:46:25,187 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 191 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:25,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 967 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:46:25,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-09 02:46:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 273. [2025-03-09 02:46:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.656441717791411) internal successors, (270), 265 states have internal predecessors, (270), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 281 transitions. [2025-03-09 02:46:25,193 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 281 transitions. Word has length 45 [2025-03-09 02:46:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:25,194 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 281 transitions. [2025-03-09 02:46:25,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 281 transitions. [2025-03-09 02:46:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:46:25,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:25,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:25,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:25,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:25,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_27_to_35_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:25,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1125824495, now seen corresponding path program 1 times [2025-03-09 02:46:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:25,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592708171] [2025-03-09 02:46:25,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:25,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:46:25,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:46:25,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:25,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:25,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:25,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592708171] [2025-03-09 02:46:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592708171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:25,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524645530] [2025-03-09 02:46:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:25,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:25,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:25,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:25,580 INFO L87 Difference]: Start difference. First operand 273 states and 281 transitions. Second operand has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:25,645 INFO L93 Difference]: Finished difference Result 382 states and 386 transitions. [2025-03-09 02:46:25,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:25,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-09 02:46:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:25,646 INFO L225 Difference]: With dead ends: 382 [2025-03-09 02:46:25,646 INFO L226 Difference]: Without dead ends: 380 [2025-03-09 02:46:25,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:25,647 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 195 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:25,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1067 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-09 02:46:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 273. [2025-03-09 02:46:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.6441717791411044) internal successors, (268), 265 states have internal predecessors, (268), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 279 transitions. [2025-03-09 02:46:25,657 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 279 transitions. Word has length 46 [2025-03-09 02:46:25,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:25,657 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 279 transitions. [2025-03-09 02:46:25,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 279 transitions. [2025-03-09 02:46:25,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:46:25,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:25,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:25,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:46:25,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_27_to_35_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:25,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:25,659 INFO L85 PathProgramCache]: Analyzing trace with hash 414422799, now seen corresponding path program 1 times [2025-03-09 02:46:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:25,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342661969] [2025-03-09 02:46:25,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:25,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:46:25,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:46:25,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:25,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:25,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342661969] [2025-03-09 02:46:25,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342661969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:25,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:25,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:25,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348958450] [2025-03-09 02:46:25,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:25,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:25,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:25,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:25,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:25,830 INFO L87 Difference]: Start difference. First operand 273 states and 279 transitions. Second operand has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:26,384 INFO L93 Difference]: Finished difference Result 380 states and 384 transitions. [2025-03-09 02:46:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-09 02:46:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:26,386 INFO L225 Difference]: With dead ends: 380 [2025-03-09 02:46:26,386 INFO L226 Difference]: Without dead ends: 379 [2025-03-09 02:46:26,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:26,386 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 191 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:26,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1129 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:46:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-09 02:46:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 273. [2025-03-09 02:46:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.638036809815951) internal successors, (267), 265 states have internal predecessors, (267), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 278 transitions. [2025-03-09 02:46:26,395 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 278 transitions. Word has length 48 [2025-03-09 02:46:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:26,395 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 278 transitions. [2025-03-09 02:46:26,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 278 transitions. [2025-03-09 02:46:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:46:26,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:26,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:26,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:46:26,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_27_to_35_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:26,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:26,400 INFO L85 PathProgramCache]: Analyzing trace with hash -37795001, now seen corresponding path program 1 times [2025-03-09 02:46:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717513568] [2025-03-09 02:46:26,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:26,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:46:26,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:46:26,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:26,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:26,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717513568] [2025-03-09 02:46:26,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717513568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:26,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:26,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:26,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987704031] [2025-03-09 02:46:26,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:26,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:26,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:26,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:26,548 INFO L87 Difference]: Start difference. First operand 273 states and 278 transitions. Second operand has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:26,924 INFO L93 Difference]: Finished difference Result 379 states and 383 transitions. [2025-03-09 02:46:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:26,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-09 02:46:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:26,925 INFO L225 Difference]: With dead ends: 379 [2025-03-09 02:46:26,925 INFO L226 Difference]: Without dead ends: 378 [2025-03-09 02:46:26,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:26,926 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 188 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:26,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 995 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:46:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-09 02:46:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 273. [2025-03-09 02:46:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 163 states have (on average 1.6319018404907975) internal successors, (266), 265 states have internal predecessors, (266), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 277 transitions. [2025-03-09 02:46:26,931 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 277 transitions. Word has length 49 [2025-03-09 02:46:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:26,932 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 277 transitions. [2025-03-09 02:46:26,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:46:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 277 transitions. [2025-03-09 02:46:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:46:26,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:26,932 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:26,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:46:26,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_27_to_35_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:26,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 448662748, now seen corresponding path program 1 times [2025-03-09 02:46:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:26,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104252798] [2025-03-09 02:46:26,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:26,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:46:26,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:46:26,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:26,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:27,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:27,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104252798] [2025-03-09 02:46:27,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104252798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:27,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:27,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:27,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727939246] [2025-03-09 02:46:27,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:27,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:27,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:27,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:27,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:27,104 INFO L87 Difference]: Start difference. First operand 273 states and 277 transitions. Second operand has 7 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:27,169 INFO L93 Difference]: Finished difference Result 372 states and 376 transitions. [2025-03-09 02:46:27,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:27,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-09 02:46:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:27,171 INFO L225 Difference]: With dead ends: 372 [2025-03-09 02:46:27,171 INFO L226 Difference]: Without dead ends: 371 [2025-03-09 02:46:27,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:27,171 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 149 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:27,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1122 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-09 02:46:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 274. [2025-03-09 02:46:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 164 states have (on average 1.6280487804878048) internal successors, (267), 266 states have internal predecessors, (267), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 278 transitions. [2025-03-09 02:46:27,177 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 278 transitions. Word has length 57 [2025-03-09 02:46:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:27,178 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 278 transitions. [2025-03-09 02:46:27,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 278 transitions. [2025-03-09 02:46:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 02:46:27,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:27,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:27,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:46:27,178 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_27_to_35_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:27,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1023643408, now seen corresponding path program 1 times [2025-03-09 02:46:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:27,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10605360] [2025-03-09 02:46:27,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:27,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:27,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:46:27,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:46:27,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:27,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:27,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:27,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10605360] [2025-03-09 02:46:27,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10605360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:27,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:27,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:27,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552222114] [2025-03-09 02:46:27,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:27,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:27,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:27,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:27,344 INFO L87 Difference]: Start difference. First operand 274 states and 278 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:27,406 INFO L93 Difference]: Finished difference Result 274 states and 278 transitions. [2025-03-09 02:46:27,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:27,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-09 02:46:27,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:27,408 INFO L225 Difference]: With dead ends: 274 [2025-03-09 02:46:27,408 INFO L226 Difference]: Without dead ends: 273 [2025-03-09 02:46:27,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:27,410 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 275 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:27,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 959 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-09 02:46:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-03-09 02:46:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 164 states have (on average 1.6219512195121952) internal successors, (266), 265 states have internal predecessors, (266), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 277 transitions. [2025-03-09 02:46:27,416 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 277 transitions. Word has length 58 [2025-03-09 02:46:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:27,416 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 277 transitions. [2025-03-09 02:46:27,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 277 transitions. [2025-03-09 02:46:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 02:46:27,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:27,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:27,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:46:27,418 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_27_to_35_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:27,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1668174682, now seen corresponding path program 1 times [2025-03-09 02:46:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:27,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495101175] [2025-03-09 02:46:27,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:27,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:46:27,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:46:27,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:27,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:27,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495101175] [2025-03-09 02:46:27,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495101175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:27,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:27,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989568012] [2025-03-09 02:46:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:27,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:27,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:27,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:27,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:27,562 INFO L87 Difference]: Start difference. First operand 273 states and 277 transitions. Second operand has 6 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:27,721 INFO L93 Difference]: Finished difference Result 369 states and 374 transitions. [2025-03-09 02:46:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:27,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2025-03-09 02:46:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:27,723 INFO L225 Difference]: With dead ends: 369 [2025-03-09 02:46:27,724 INFO L226 Difference]: Without dead ends: 367 [2025-03-09 02:46:27,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:27,725 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 145 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:27,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 904 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-09 02:46:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 276. [2025-03-09 02:46:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 167 states have (on average 1.6107784431137724) internal successors, (269), 268 states have internal predecessors, (269), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-09 02:46:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2025-03-09 02:46:27,735 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 59 [2025-03-09 02:46:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:27,735 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2025-03-09 02:46:27,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2025-03-09 02:46:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:46:27,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:27,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:27,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:46:27,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:27,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash 174888596, now seen corresponding path program 1 times [2025-03-09 02:46:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:27,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729936598] [2025-03-09 02:46:27,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:27,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:27,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:46:27,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:46:27,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:27,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729936598] [2025-03-09 02:46:27,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729936598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:27,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908701559] [2025-03-09 02:46:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:27,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:27,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:27,845 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:28,104 INFO L93 Difference]: Finished difference Result 369 states and 374 transitions. [2025-03-09 02:46:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:46:28,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-09 02:46:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:28,105 INFO L225 Difference]: With dead ends: 369 [2025-03-09 02:46:28,105 INFO L226 Difference]: Without dead ends: 357 [2025-03-09 02:46:28,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:28,106 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 193 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:28,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 570 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-09 02:46:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 291. [2025-03-09 02:46:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 181 states have (on average 1.5635359116022098) internal successors, (283), 281 states have internal predecessors, (283), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 02:46:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 295 transitions. [2025-03-09 02:46:28,114 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 295 transitions. Word has length 60 [2025-03-09 02:46:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:28,115 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 295 transitions. [2025-03-09 02:46:28,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 295 transitions. [2025-03-09 02:46:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 02:46:28,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:28,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:28,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:46:28,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_27_to_35_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:28,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1093071320, now seen corresponding path program 1 times [2025-03-09 02:46:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:28,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484214442] [2025-03-09 02:46:28,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:28,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:28,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 02:46:28,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 02:46:28,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:28,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:28,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2093358124] [2025-03-09 02:46:28,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:28,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:28,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:28,137 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:28,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:46:28,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 02:46:28,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 02:46:28,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:28,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:28,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:46:28,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:28,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:46:28,344 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 26 treesize of output 14 [2025-03-09 02:46:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:28,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:28,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484214442] [2025-03-09 02:46:28,354 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:28,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093358124] [2025-03-09 02:46:28,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093358124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:28,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:28,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:46:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098510059] [2025-03-09 02:46:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:28,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:46:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:28,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:46:28,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:28,355 INFO L87 Difference]: Start difference. First operand 291 states and 295 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:28,658 INFO L93 Difference]: Finished difference Result 359 states and 365 transitions. [2025-03-09 02:46:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:28,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2025-03-09 02:46:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:28,660 INFO L225 Difference]: With dead ends: 359 [2025-03-09 02:46:28,660 INFO L226 Difference]: Without dead ends: 357 [2025-03-09 02:46:28,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:46:28,661 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 365 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:28,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 799 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:46:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-09 02:46:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 289. [2025-03-09 02:46:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 181 states have (on average 1.5524861878453038) internal successors, (281), 279 states have internal predecessors, (281), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 02:46:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 293 transitions. [2025-03-09 02:46:28,668 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 293 transitions. Word has length 61 [2025-03-09 02:46:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:28,668 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 293 transitions. [2025-03-09 02:46:28,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 293 transitions. [2025-03-09 02:46:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 02:46:28,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:28,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:28,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:28,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:46:28,870 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_27_to_35_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:28,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash -474527348, now seen corresponding path program 1 times [2025-03-09 02:46:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086268520] [2025-03-09 02:46:28,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:28,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:28,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:46:28,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:46:28,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:28,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284804736] [2025-03-09 02:46:28,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:28,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:28,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:28,893 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:28,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:46:28,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:46:28,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:46:28,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:28,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:28,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:46:28,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:28,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:29,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:29,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:29,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086268520] [2025-03-09 02:46:29,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:29,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284804736] [2025-03-09 02:46:29,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284804736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:29,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:29,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:46:29,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068809173] [2025-03-09 02:46:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:29,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:46:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:29,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:46:29,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:29,097 INFO L87 Difference]: Start difference. First operand 289 states and 293 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:29,332 INFO L93 Difference]: Finished difference Result 374 states and 385 transitions. [2025-03-09 02:46:29,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:29,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-09 02:46:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:29,334 INFO L225 Difference]: With dead ends: 374 [2025-03-09 02:46:29,334 INFO L226 Difference]: Without dead ends: 373 [2025-03-09 02:46:29,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:29,335 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 222 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:29,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 823 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-09 02:46:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 326. [2025-03-09 02:46:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 315 states have internal predecessors, (346), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 360 transitions. [2025-03-09 02:46:29,343 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 360 transitions. Word has length 62 [2025-03-09 02:46:29,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:29,343 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 360 transitions. [2025-03-09 02:46:29,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 360 transitions. [2025-03-09 02:46:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 02:46:29,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:29,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:29,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:29,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:29,548 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_27_to_35_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:29,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:29,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1825445802, now seen corresponding path program 1 times [2025-03-09 02:46:29,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:29,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376419444] [2025-03-09 02:46:29,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:29,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 02:46:29,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 02:46:29,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:29,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:29,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [274235238] [2025-03-09 02:46:29,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:29,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:29,572 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:29,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:46:29,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 02:46:29,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 02:46:29,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:29,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:29,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 02:46:29,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:29,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:46:29,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 02:46:29,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 02:46:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:29,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376419444] [2025-03-09 02:46:29,815 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274235238] [2025-03-09 02:46:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274235238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:29,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:29,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:46:29,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054911719] [2025-03-09 02:46:29,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:29,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:29,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:29,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:29,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:29,816 INFO L87 Difference]: Start difference. First operand 326 states and 360 transitions. Second operand has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:30,086 INFO L93 Difference]: Finished difference Result 363 states and 368 transitions. [2025-03-09 02:46:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:46:30,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-09 02:46:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:30,088 INFO L225 Difference]: With dead ends: 363 [2025-03-09 02:46:30,088 INFO L226 Difference]: Without dead ends: 362 [2025-03-09 02:46:30,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:46:30,089 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 446 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:30,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 788 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-09 02:46:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 325. [2025-03-09 02:46:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 216 states have (on average 1.5972222222222223) internal successors, (345), 314 states have internal predecessors, (345), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 359 transitions. [2025-03-09 02:46:30,099 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 359 transitions. Word has length 63 [2025-03-09 02:46:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:30,099 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 359 transitions. [2025-03-09 02:46:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 359 transitions. [2025-03-09 02:46:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:46:30,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:30,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:30,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:30,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:30,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_27_to_35_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:30,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:30,301 INFO L85 PathProgramCache]: Analyzing trace with hash -754244918, now seen corresponding path program 1 times [2025-03-09 02:46:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:30,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882090943] [2025-03-09 02:46:30,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:30,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:30,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:46:30,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:46:30,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:30,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:30,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071532815] [2025-03-09 02:46:30,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:30,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:30,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:30,325 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:30,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:46:30,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:46:30,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:46:30,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:30,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:30,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 02:46:30,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:30,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:30,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-09 02:46:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:30,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:30,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:30,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882090943] [2025-03-09 02:46:30,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:30,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071532815] [2025-03-09 02:46:30,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071532815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:30,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:30,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:46:30,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210021353] [2025-03-09 02:46:30,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:30,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:30,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:30,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:30,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:30,532 INFO L87 Difference]: Start difference. First operand 325 states and 359 transitions. Second operand has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:30,770 INFO L93 Difference]: Finished difference Result 373 states and 382 transitions. [2025-03-09 02:46:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:46:30,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2025-03-09 02:46:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:30,772 INFO L225 Difference]: With dead ends: 373 [2025-03-09 02:46:30,772 INFO L226 Difference]: Without dead ends: 372 [2025-03-09 02:46:30,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:46:30,772 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 228 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:30,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 857 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-09 02:46:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 327. [2025-03-09 02:46:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 218 states have (on average 1.591743119266055) internal successors, (347), 316 states have internal predecessors, (347), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 361 transitions. [2025-03-09 02:46:30,781 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 361 transitions. Word has length 64 [2025-03-09 02:46:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:30,781 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 361 transitions. [2025-03-09 02:46:30,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 361 transitions. [2025-03-09 02:46:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:46:30,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:30,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:30,787 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-09 02:46:30,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:30,982 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_27_to_35_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:30,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:30,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1906755884, now seen corresponding path program 1 times [2025-03-09 02:46:30,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:30,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203533926] [2025-03-09 02:46:30,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:30,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:46:31,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:46:31,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:31,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:31,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229505739] [2025-03-09 02:46:31,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:31,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:31,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:31,006 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:31,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:46:31,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:46:31,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:46:31,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:31,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:31,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:46:31,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:31,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:46:31,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 02:46:31,234 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 36 treesize of output 16 [2025-03-09 02:46:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:31,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203533926] [2025-03-09 02:46:31,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229505739] [2025-03-09 02:46:31,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229505739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:31,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:31,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 02:46:31,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108958382] [2025-03-09 02:46:31,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:31,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:46:31,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:31,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:46:31,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:31,252 INFO L87 Difference]: Start difference. First operand 327 states and 361 transitions. Second operand has 10 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:31,582 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2025-03-09 02:46:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:46:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2025-03-09 02:46:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:31,583 INFO L225 Difference]: With dead ends: 364 [2025-03-09 02:46:31,583 INFO L226 Difference]: Without dead ends: 363 [2025-03-09 02:46:31,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:46:31,584 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 354 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:31,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1108 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:46:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-09 02:46:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 326. [2025-03-09 02:46:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 218 states have (on average 1.5871559633027523) internal successors, (346), 315 states have internal predecessors, (346), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 360 transitions. [2025-03-09 02:46:31,591 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 360 transitions. Word has length 65 [2025-03-09 02:46:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:31,591 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 360 transitions. [2025-03-09 02:46:31,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 360 transitions. [2025-03-09 02:46:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:46:31,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:31,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:31,599 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-09 02:46:31,796 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,SelfDestructingSolverStorable20 [2025-03-09 02:46:31,796 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_27_to_35_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:31,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1020109832, now seen corresponding path program 1 times [2025-03-09 02:46:31,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:31,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444628711] [2025-03-09 02:46:31,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:31,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:46:31,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:46:31,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:31,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:31,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452482273] [2025-03-09 02:46:31,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:31,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:31,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:31,820 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:31,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:46:31,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:46:31,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:46:31,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:31,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:31,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 02:46:31,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:31,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 11 treesize of output 7 [2025-03-09 02:46:31,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-09 02:46:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:32,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444628711] [2025-03-09 02:46:32,051 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452482273] [2025-03-09 02:46:32,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452482273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:32,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 02:46:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329372199] [2025-03-09 02:46:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:32,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:46:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:32,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:46:32,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:32,053 INFO L87 Difference]: Start difference. First operand 326 states and 360 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:32,302 INFO L93 Difference]: Finished difference Result 372 states and 379 transitions. [2025-03-09 02:46:32,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:46:32,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2025-03-09 02:46:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:32,306 INFO L225 Difference]: With dead ends: 372 [2025-03-09 02:46:32,306 INFO L226 Difference]: Without dead ends: 371 [2025-03-09 02:46:32,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:46:32,307 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 224 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:32,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1084 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-09 02:46:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 328. [2025-03-09 02:46:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 220 states have (on average 1.5818181818181818) internal successors, (348), 317 states have internal predecessors, (348), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 362 transitions. [2025-03-09 02:46:32,315 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 362 transitions. Word has length 66 [2025-03-09 02:46:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:32,315 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 362 transitions. [2025-03-09 02:46:32,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 362 transitions. [2025-03-09 02:46:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 02:46:32,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:32,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:32,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:32,520 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,SelfDestructingSolverStorable21 [2025-03-09 02:46:32,520 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_27_to_35_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:32,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1558633810, now seen corresponding path program 1 times [2025-03-09 02:46:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:32,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516827963] [2025-03-09 02:46:32,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:32,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:32,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 02:46:32,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:46:32,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:32,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:32,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518506328] [2025-03-09 02:46:32,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:32,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:32,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:32,543 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:32,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:46:32,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 02:46:32,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:46:32,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:32,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:32,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 02:46:32,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:32,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:46:32,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 02:46:32,795 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 43 treesize of output 19 [2025-03-09 02:46:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:32,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516827963] [2025-03-09 02:46:32,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518506328] [2025-03-09 02:46:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518506328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:32,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:32,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 02:46:32,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023076015] [2025-03-09 02:46:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:32,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:46:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:32,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:46:32,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:46:32,812 INFO L87 Difference]: Start difference. First operand 328 states and 362 transitions. Second operand has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:33,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:33,128 INFO L93 Difference]: Finished difference Result 365 states and 370 transitions. [2025-03-09 02:46:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:46:33,130 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2025-03-09 02:46:33,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:33,131 INFO L225 Difference]: With dead ends: 365 [2025-03-09 02:46:33,131 INFO L226 Difference]: Without dead ends: 364 [2025-03-09 02:46:33,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:46:33,132 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 427 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:33,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1262 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-09 02:46:33,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 327. [2025-03-09 02:46:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 316 states have internal predecessors, (347), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 361 transitions. [2025-03-09 02:46:33,139 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 361 transitions. Word has length 67 [2025-03-09 02:46:33,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:33,139 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 361 transitions. [2025-03-09 02:46:33,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 361 transitions. [2025-03-09 02:46:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 02:46:33,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:33,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:33,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 02:46:33,340 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,SelfDestructingSolverStorable22 [2025-03-09 02:46:33,340 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_27_to_35_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:33,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:33,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1073007942, now seen corresponding path program 1 times [2025-03-09 02:46:33,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:33,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591335780] [2025-03-09 02:46:33,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:33,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:46:33,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:46:33,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:33,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:33,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696114346] [2025-03-09 02:46:33,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:33,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:33,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:33,359 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:33,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:46:33,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 02:46:33,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:46:33,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:33,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:33,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 02:46:33,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:33,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:33,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-09 02:46:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:33,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:33,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:33,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591335780] [2025-03-09 02:46:33,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696114346] [2025-03-09 02:46:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696114346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:33,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 02:46:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407679785] [2025-03-09 02:46:33,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:33,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:46:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:33,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:46:33,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:46:33,622 INFO L87 Difference]: Start difference. First operand 327 states and 361 transitions. Second operand has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:33,844 INFO L93 Difference]: Finished difference Result 371 states and 376 transitions. [2025-03-09 02:46:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:46:33,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2025-03-09 02:46:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:33,846 INFO L225 Difference]: With dead ends: 371 [2025-03-09 02:46:33,846 INFO L226 Difference]: Without dead ends: 370 [2025-03-09 02:46:33,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:46:33,847 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 220 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:33,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1086 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-09 02:46:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 329. [2025-03-09 02:46:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 222 states have (on average 1.572072072072072) internal successors, (349), 318 states have internal predecessors, (349), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 363 transitions. [2025-03-09 02:46:33,853 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 363 transitions. Word has length 68 [2025-03-09 02:46:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:33,853 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 363 transitions. [2025-03-09 02:46:33,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 363 transitions. [2025-03-09 02:46:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:46:33,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:33,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:33,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:34,058 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,SelfDestructingSolverStorable23 [2025-03-09 02:46:34,058 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_27_to_35_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:34,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1096492080, now seen corresponding path program 1 times [2025-03-09 02:46:34,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:34,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462179500] [2025-03-09 02:46:34,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:34,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:46:34,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:46:34,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:34,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:34,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:34,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462179500] [2025-03-09 02:46:34,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462179500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:34,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:34,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:34,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654442941] [2025-03-09 02:46:34,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:34,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:34,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:34,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:34,195 INFO L87 Difference]: Start difference. First operand 329 states and 363 transitions. Second operand has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:34,323 INFO L93 Difference]: Finished difference Result 359 states and 367 transitions. [2025-03-09 02:46:34,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:34,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2025-03-09 02:46:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:34,325 INFO L225 Difference]: With dead ends: 359 [2025-03-09 02:46:34,325 INFO L226 Difference]: Without dead ends: 358 [2025-03-09 02:46:34,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:34,326 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 134 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:34,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1088 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-09 02:46:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 330. [2025-03-09 02:46:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 223 states have (on average 1.5695067264573992) internal successors, (350), 319 states have internal predecessors, (350), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 364 transitions. [2025-03-09 02:46:34,334 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 364 transitions. Word has length 69 [2025-03-09 02:46:34,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:34,334 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 364 transitions. [2025-03-09 02:46:34,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 364 transitions. [2025-03-09 02:46:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 02:46:34,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:34,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:34,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 02:46:34,337 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_27_to_35_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:34,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:34,338 INFO L85 PathProgramCache]: Analyzing trace with hash 368483972, now seen corresponding path program 1 times [2025-03-09 02:46:34,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:34,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798990155] [2025-03-09 02:46:34,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:34,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:34,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 02:46:34,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 02:46:34,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:34,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:34,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798990155] [2025-03-09 02:46:34,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798990155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:34,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:34,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:34,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759099029] [2025-03-09 02:46:34,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:34,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:34,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:34,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:34,457 INFO L87 Difference]: Start difference. First operand 330 states and 364 transitions. Second operand has 6 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:34,563 INFO L93 Difference]: Finished difference Result 358 states and 366 transitions. [2025-03-09 02:46:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:34,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2025-03-09 02:46:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:34,564 INFO L225 Difference]: With dead ends: 358 [2025-03-09 02:46:34,564 INFO L226 Difference]: Without dead ends: 357 [2025-03-09 02:46:34,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:34,565 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 129 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:34,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1041 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-09 02:46:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 331. [2025-03-09 02:46:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 224 states have (on average 1.5669642857142858) internal successors, (351), 320 states have internal predecessors, (351), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 365 transitions. [2025-03-09 02:46:34,574 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 365 transitions. Word has length 70 [2025-03-09 02:46:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:34,575 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 365 transitions. [2025-03-09 02:46:34,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 365 transitions. [2025-03-09 02:46:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 02:46:34,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:34,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:34,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 02:46:34,575 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:34,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1200888136, now seen corresponding path program 1 times [2025-03-09 02:46:34,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:34,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804066329] [2025-03-09 02:46:34,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:34,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:34,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 02:46:34,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 02:46:34,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:34,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:34,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:34,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804066329] [2025-03-09 02:46:34,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804066329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:34,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:34,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:34,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096969814] [2025-03-09 02:46:34,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:34,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:34,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:34,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:34,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:34,667 INFO L87 Difference]: Start difference. First operand 331 states and 365 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:34,898 INFO L93 Difference]: Finished difference Result 366 states and 370 transitions. [2025-03-09 02:46:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:46:34,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 72 [2025-03-09 02:46:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:34,900 INFO L225 Difference]: With dead ends: 366 [2025-03-09 02:46:34,900 INFO L226 Difference]: Without dead ends: 356 [2025-03-09 02:46:34,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:34,900 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 148 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:34,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 549 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-09 02:46:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 331. [2025-03-09 02:46:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 224 states have (on average 1.5223214285714286) internal successors, (341), 320 states have internal predecessors, (341), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 355 transitions. [2025-03-09 02:46:34,906 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 355 transitions. Word has length 72 [2025-03-09 02:46:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:34,907 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 355 transitions. [2025-03-09 02:46:34,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 355 transitions. [2025-03-09 02:46:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-09 02:46:34,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:34,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:34,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 02:46:34,907 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_27_to_35_0Err55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:34,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:34,907 INFO L85 PathProgramCache]: Analyzing trace with hash -450940358, now seen corresponding path program 1 times [2025-03-09 02:46:34,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:34,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113919944] [2025-03-09 02:46:34,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:34,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:34,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 02:46:34,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 02:46:34,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:34,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:35,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:35,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113919944] [2025-03-09 02:46:35,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113919944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:35,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213461293] [2025-03-09 02:46:35,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:35,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:35,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:35,108 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:35,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 02:46:35,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 02:46:35,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 02:46:35,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:35,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:35,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 02:46:35,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:35,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-09 02:46:35,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:46:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:35,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213461293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:35,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-09 02:46:35,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092377013] [2025-03-09 02:46:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:35,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:46:35,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:35,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:46:35,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:46:35,352 INFO L87 Difference]: Start difference. First operand 331 states and 355 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:39,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:44,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:44,063 INFO L93 Difference]: Finished difference Result 334 states and 362 transitions. [2025-03-09 02:46:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 02:46:44,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2025-03-09 02:46:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:44,065 INFO L225 Difference]: With dead ends: 334 [2025-03-09 02:46:44,065 INFO L226 Difference]: Without dead ends: 332 [2025-03-09 02:46:44,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:46:44,066 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 426 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:44,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 854 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 614 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-03-09 02:46:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-09 02:46:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2025-03-09 02:46:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 224 states have (on average 1.5133928571428572) internal successors, (339), 318 states have internal predecessors, (339), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 353 transitions. [2025-03-09 02:46:44,075 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 353 transitions. Word has length 74 [2025-03-09 02:46:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:44,075 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 353 transitions. [2025-03-09 02:46:44,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 353 transitions. [2025-03-09 02:46:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 02:46:44,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:44,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:44,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:44,279 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting func_to_recursive_line_27_to_35_0Err54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:44,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1094249012, now seen corresponding path program 1 times [2025-03-09 02:46:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647211865] [2025-03-09 02:46:44,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:44,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 02:46:44,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 02:46:44,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:44,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:44,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647211865] [2025-03-09 02:46:44,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647211865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:44,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864347254] [2025-03-09 02:46:44,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:44,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:44,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:44,501 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:44,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 02:46:44,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 02:46:44,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 02:46:44,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:44,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:44,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 02:46:44,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:44,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-03-09 02:46:44,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 02:46:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:44,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:44,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864347254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:46:44,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:46:44,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-03-09 02:46:44,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114842771] [2025-03-09 02:46:44,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:44,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 02:46:44,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:44,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 02:46:44,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:46:44,909 INFO L87 Difference]: Start difference. First operand 329 states and 353 transitions. Second operand has 21 states, 19 states have (on average 10.631578947368421) internal successors, (202), 17 states have internal predecessors, (202), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:46:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:45,640 INFO L93 Difference]: Finished difference Result 357 states and 365 transitions. [2025-03-09 02:46:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:46:45,642 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 10.631578947368421) internal successors, (202), 17 states have internal predecessors, (202), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 75 [2025-03-09 02:46:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:45,643 INFO L225 Difference]: With dead ends: 357 [2025-03-09 02:46:45,643 INFO L226 Difference]: Without dead ends: 356 [2025-03-09 02:46:45,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2025-03-09 02:46:45,644 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 977 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:45,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1610 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:46:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-09 02:46:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 328. [2025-03-09 02:46:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 224 states have (on average 1.5089285714285714) internal successors, (338), 317 states have internal predecessors, (338), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:46:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 352 transitions. [2025-03-09 02:46:45,655 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 352 transitions. Word has length 75 [2025-03-09 02:46:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:45,655 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 352 transitions. [2025-03-09 02:46:45,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 10.631578947368421) internal successors, (202), 17 states have internal predecessors, (202), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:46:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 352 transitions. [2025-03-09 02:46:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 02:46:45,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:45,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:45,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 02:46:45,856 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,SelfDestructingSolverStorable28 [2025-03-09 02:46:45,857 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting func_to_recursive_line_27_to_35_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:45,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 438019192, now seen corresponding path program 1 times [2025-03-09 02:46:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:45,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031350901] [2025-03-09 02:46:45,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:45,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:45,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 02:46:45,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 02:46:45,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:45,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:45,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214332048] [2025-03-09 02:46:45,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:45,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:45,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:45,876 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:45,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 02:46:45,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 02:46:45,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 02:46:45,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:45,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:45,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 02:46:45,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:45,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:46,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-09 02:46:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:46,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:47,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031350901] [2025-03-09 02:46:47,627 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214332048] [2025-03-09 02:46:47,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214332048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:47,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:47,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-09 02:46:47,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849953466] [2025-03-09 02:46:47,627 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:47,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:46:47,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:47,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:46:47,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=221, Unknown=1, NotChecked=0, Total=272 [2025-03-09 02:46:47,627 INFO L87 Difference]: Start difference. First operand 328 states and 352 transitions. Second operand has 11 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:48,015 INFO L93 Difference]: Finished difference Result 454 states and 460 transitions. [2025-03-09 02:46:48,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:46:48,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2025-03-09 02:46:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:48,017 INFO L225 Difference]: With dead ends: 454 [2025-03-09 02:46:48,017 INFO L226 Difference]: Without dead ends: 453 [2025-03-09 02:46:48,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=99, Invalid=362, Unknown=1, NotChecked=0, Total=462 [2025-03-09 02:46:48,018 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 497 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:48,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1165 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:46:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-09 02:46:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 380. [2025-03-09 02:46:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 272 states have (on average 1.5661764705882353) internal successors, (426), 366 states have internal predecessors, (426), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-09 02:46:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 446 transitions. [2025-03-09 02:46:48,030 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 446 transitions. Word has length 76 [2025-03-09 02:46:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:48,030 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 446 transitions. [2025-03-09 02:46:48,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 446 transitions. [2025-03-09 02:46:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 02:46:48,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:48,035 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:48,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 02:46:48,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:48,235 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting func_to_recursive_line_27_to_35_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:48,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 693693258, now seen corresponding path program 1 times [2025-03-09 02:46:48,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:48,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690792777] [2025-03-09 02:46:48,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:48,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:46:48,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:46:48,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:48,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95791306] [2025-03-09 02:46:48,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:48,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:48,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:48,256 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-09 02:46:48,256 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-09 02:46:48,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:46:48,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:46:48,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:48,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:48,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 02:46:48,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:48,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:46:48,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-09 02:46:48,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-09 02:46:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:48,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:48,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690792777] [2025-03-09 02:46:48,804 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95791306] [2025-03-09 02:46:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95791306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:46:48,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:46:48,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-03-09 02:46:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270386197] [2025-03-09 02:46:48,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:48,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 02:46:48,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:48,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 02:46:48,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:46:48,805 INFO L87 Difference]: Start difference. First operand 380 states and 446 transitions. Second operand has 17 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:50,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-09 02:46:51,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-03-09 02:46:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:53,062 INFO L93 Difference]: Finished difference Result 407 states and 454 transitions. [2025-03-09 02:46:53,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:46:53,062 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 77 [2025-03-09 02:46:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:53,063 INFO L225 Difference]: With dead ends: 407 [2025-03-09 02:46:53,063 INFO L226 Difference]: Without dead ends: 406 [2025-03-09 02:46:53,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:46:53,064 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 773 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:53,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1494 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 968 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2025-03-09 02:46:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-09 02:46:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 381. [2025-03-09 02:46:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 273 states have (on average 1.5567765567765568) internal successors, (425), 366 states have internal predecessors, (425), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:46:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 447 transitions. [2025-03-09 02:46:53,072 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 447 transitions. Word has length 77 [2025-03-09 02:46:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:53,073 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 447 transitions. [2025-03-09 02:46:53,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 447 transitions. [2025-03-09 02:46:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 02:46:53,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:53,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:53,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 02:46:53,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:53,274 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting func_to_recursive_line_27_to_35_0Err51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:53,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash 29654710, now seen corresponding path program 1 times [2025-03-09 02:46:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:53,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981997196] [2025-03-09 02:46:53,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:53,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:53,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:46:53,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:46:53,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:53,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:53,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73159342] [2025-03-09 02:46:53,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:53,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:53,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:53,294 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-09 02:46:53,295 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-09 02:46:53,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:46:53,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:46:53,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:53,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:53,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-09 02:46:53,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:53,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-09 02:46:53,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-09 02:46:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:53,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:54,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981997196] [2025-03-09 02:46:54,168 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73159342] [2025-03-09 02:46:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73159342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:46:54,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:46:54,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2025-03-09 02:46:54,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172071266] [2025-03-09 02:46:54,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:54,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:46:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:54,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:46:54,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:46:54,170 INFO L87 Difference]: Start difference. First operand 381 states and 447 transitions. Second operand has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 19 states have internal predecessors, (145), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:55,992 INFO L93 Difference]: Finished difference Result 564 states and 575 transitions. [2025-03-09 02:46:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 02:46:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 19 states have internal predecessors, (145), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 78 [2025-03-09 02:46:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:55,994 INFO L225 Difference]: With dead ends: 564 [2025-03-09 02:46:55,994 INFO L226 Difference]: Without dead ends: 562 [2025-03-09 02:46:55,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=1142, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 02:46:55,995 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1072 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:55,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 2330 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 02:46:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-09 02:46:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 447. [2025-03-09 02:46:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 335 states have (on average 1.5850746268656717) internal successors, (531), 429 states have internal predecessors, (531), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-09 02:46:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 559 transitions. [2025-03-09 02:46:56,008 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 559 transitions. Word has length 78 [2025-03-09 02:46:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:56,008 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 559 transitions. [2025-03-09 02:46:56,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 19 states have internal predecessors, (145), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:46:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 559 transitions. [2025-03-09 02:46:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 02:46:56,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:56,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:56,020 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-09 02:46:56,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:56,210 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting func_to_recursive_line_27_to_35_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:56,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1566588684, now seen corresponding path program 1 times [2025-03-09 02:46:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:56,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932600391] [2025-03-09 02:46:56,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:56,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:56,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:46:56,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:46:56,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:56,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:56,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545757460] [2025-03-09 02:46:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:56,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:56,234 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-09 02:46:56,237 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-09 02:46:56,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:46:56,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:46:56,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:56,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-09 02:46:56,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:56,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:56,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-09 02:46:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:56,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:57,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932600391] [2025-03-09 02:46:57,039 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545757460] [2025-03-09 02:46:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545757460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:57,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-09 02:46:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420047648] [2025-03-09 02:46:57,040 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:46:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:57,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:46:57,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:46:57,040 INFO L87 Difference]: Start difference. First operand 447 states and 559 transitions. Second operand has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:57,559 INFO L93 Difference]: Finished difference Result 513 states and 567 transitions. [2025-03-09 02:46:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:46:57,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2025-03-09 02:46:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:57,560 INFO L225 Difference]: With dead ends: 513 [2025-03-09 02:46:57,560 INFO L226 Difference]: Without dead ends: 512 [2025-03-09 02:46:57,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2025-03-09 02:46:57,561 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 527 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:57,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1311 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:46:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-09 02:46:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 447. [2025-03-09 02:46:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 335 states have (on average 1.5820895522388059) internal successors, (530), 429 states have internal predecessors, (530), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-09 02:46:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 558 transitions. [2025-03-09 02:46:57,595 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 558 transitions. Word has length 80 [2025-03-09 02:46:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:57,595 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 558 transitions. [2025-03-09 02:46:57,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:46:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 558 transitions. [2025-03-09 02:46:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 02:46:57,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:57,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:57,603 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-09 02:46:57,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:57,796 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting func_to_recursive_line_27_to_35_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-09 02:46:57,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1319608762, now seen corresponding path program 1 times [2025-03-09 02:46:57,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:57,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456016821] [2025-03-09 02:46:57,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:57,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:57,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:46:57,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:46:57,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:57,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492529318] [2025-03-09 02:46:57,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:57,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:57,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:57,819 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-09 02:46:57,820 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-09 02:46:57,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 02:46:57,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 02:46:57,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:57,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:57,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 02:46:57,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:57,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:46:58,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-09 02:46:58,094 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 36 treesize of output 16 [2025-03-09 02:46:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:58,117 INFO L312 TraceCheckSpWp]: Computing backward predicates...