./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.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_loop-simple/recursified_nested_3.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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:44:00,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:44:00,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:44:00,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:44:00,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:44:00,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:44:00,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:44:00,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:44:00,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:44:00,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:44:00,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:44:00,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:44:00,331 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:44:00,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:44:00,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:44:00,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:44:00,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:44:00,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:44:00,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:44:00,333 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2025-03-09 02:44:00,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:44:00,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:44:00,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:44:00,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:44:00,593 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:44:00,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-03-09 02:44:01,810 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c309b149/4898f905f78a43cdb1d2b470b762b013/FLAGfe2faab98 [2025-03-09 02:44:02,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:44:02,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-03-09 02:44:02,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c309b149/4898f905f78a43cdb1d2b470b762b013/FLAGfe2faab98 [2025-03-09 02:44:02,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c309b149/4898f905f78a43cdb1d2b470b762b013 [2025-03-09 02:44:02,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:44:02,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:44:02,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:44:02,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:44:02,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:44:02,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634d8c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02, skipping insertion in model container [2025-03-09 02:44:02,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:44:02,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:44:02,509 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:44:02,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:44:02,536 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:44:02,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02 WrapperNode [2025-03-09 02:44:02,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:44:02,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:44:02,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:44:02,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:44:02,542 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:44:02" (1/1) ... [2025-03-09 02:44:02,548 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:44:02" (1/1) ... [2025-03-09 02:44:02,560 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2025-03-09 02:44:02,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:44:02,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:44:02,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:44:02,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:44:02,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,586 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2]. [2025-03-09 02:44:02,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:44:02,604 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:44:02,604 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:44:02,604 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:44:02,605 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (1/1) ... [2025-03-09 02:44:02,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:44:02,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:02,635 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:44:02,637 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:44:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2025-03-09 02:44:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-03-09 02:44:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:44:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2025-03-09 02:44:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2025-03-09 02:44:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:44:02,734 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:44:02,736 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:44:02,839 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-09 02:44:02,872 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-09 02:44:02,873 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:44:02,879 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:44:02,879 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:44:02,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:44:02 BoogieIcfgContainer [2025-03-09 02:44:02,879 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:44:02,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:44:02,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:44:02,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:44:02,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:44:02" (1/3) ... [2025-03-09 02:44:02,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2113a4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:44:02, skipping insertion in model container [2025-03-09 02:44:02,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:02" (2/3) ... [2025-03-09 02:44:02,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2113a4a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:44:02, skipping insertion in model container [2025-03-09 02:44:02,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:44:02" (3/3) ... [2025-03-09 02:44:02,885 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2025-03-09 02:44:02,896 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:44:02,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_3.c that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-09 02:44:02,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:44:02,949 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;@4cf0e057, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:44:02,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 02:44:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:44:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 02:44:02,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:02,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:02,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:02,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash -461126826, now seen corresponding path program 1 times [2025-03-09 02:44:02,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:02,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823032741] [2025-03-09 02:44:02,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:03,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 02:44:03,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 02:44:03,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:03,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:44:03,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:03,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823032741] [2025-03-09 02:44:03,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823032741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:03,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:03,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307502665] [2025-03-09 02:44:03,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:03,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:03,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:03,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:03,399 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:44:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:03,495 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-03-09 02:44:03,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:03,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-09 02:44:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:03,502 INFO L225 Difference]: With dead ends: 89 [2025-03-09 02:44:03,502 INFO L226 Difference]: Without dead ends: 37 [2025-03-09 02:44:03,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:44:03,507 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:03,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 210 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:44:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-09 02:44:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-09 02:44:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.380952380952381) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:44:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-09 02:44:03,532 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 12 [2025-03-09 02:44:03,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:03,533 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-09 02:44:03,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:44:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-09 02:44:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 02:44:03,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:03,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:03,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:44:03,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:03,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1410029747, now seen corresponding path program 1 times [2025-03-09 02:44:03,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:03,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712927352] [2025-03-09 02:44:03,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:03,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:03,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:44:03,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:44:03,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:03,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:03,624 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:44:03,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:03,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712927352] [2025-03-09 02:44:03,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712927352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:03,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:03,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:44:03,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080904369] [2025-03-09 02:44:03,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:03,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:44:03,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:03,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:44:03,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:44:03,626 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:44:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:03,650 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-03-09 02:44:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:44:03,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 02:44:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:03,651 INFO L225 Difference]: With dead ends: 35 [2025-03-09 02:44:03,652 INFO L226 Difference]: Without dead ends: 34 [2025-03-09 02:44:03,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:44:03,652 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:03,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:44:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-09 02:44:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-09 02:44:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:44:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-09 02:44:03,659 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 13 [2025-03-09 02:44:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:03,660 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-09 02:44:03,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:44:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-09 02:44:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 02:44:03,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:03,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:03,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:44:03,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:03,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash -461135252, now seen corresponding path program 1 times [2025-03-09 02:44:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771324085] [2025-03-09 02:44:03,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:03,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 02:44:03,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 02:44:03,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:03,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:03,818 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:44:03,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:03,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771324085] [2025-03-09 02:44:03,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771324085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:03,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:03,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:44:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62747493] [2025-03-09 02:44:03,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:03,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:03,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:03,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:03,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:03,820 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:44:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:03,923 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-03-09 02:44:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:03,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2025-03-09 02:44:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:03,925 INFO L225 Difference]: With dead ends: 67 [2025-03-09 02:44:03,925 INFO L226 Difference]: Without dead ends: 36 [2025-03-09 02:44:03,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:44:03,927 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:03,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 65 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-09 02:44:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-09 02:44:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 02:44:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-09 02:44:03,934 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 12 [2025-03-09 02:44:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:03,935 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-09 02:44:03,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:44:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-09 02:44:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 02:44:03,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:03,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:03,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:44:03,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:03,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:03,938 INFO L85 PathProgramCache]: Analyzing trace with hash -946991614, now seen corresponding path program 1 times [2025-03-09 02:44:03,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:03,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768858583] [2025-03-09 02:44:03,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:03,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:03,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 02:44:03,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 02:44:03,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:03,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:04,085 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:44:04,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:04,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768858583] [2025-03-09 02:44:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768858583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:04,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:44:04,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585904655] [2025-03-09 02:44:04,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:04,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:04,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:04,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:04,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:44:04,087 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:44:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:04,164 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-03-09 02:44:04,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:44:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 02:44:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:04,165 INFO L225 Difference]: With dead ends: 42 [2025-03-09 02:44:04,165 INFO L226 Difference]: Without dead ends: 41 [2025-03-09 02:44:04,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 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:44:04,166 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 164 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:04,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 164 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:44:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-09 02:44:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2025-03-09 02:44:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 02:44:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-09 02:44:04,176 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 17 [2025-03-09 02:44:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:04,176 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-09 02:44:04,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:44:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-09 02:44:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 02:44:04,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:04,177 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] [2025-03-09 02:44:04,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:44:04,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:04,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash -421204904, now seen corresponding path program 1 times [2025-03-09 02:44:04,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:04,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79086157] [2025-03-09 02:44:04,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:04,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:04,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:44:04,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:44:04,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:04,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:04,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:04,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79086157] [2025-03-09 02:44:04,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79086157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:04,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:04,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169333987] [2025-03-09 02:44:04,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:04,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:04,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:04,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:04,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:04,307 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:44:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:04,365 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-03-09 02:44:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:04,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-09 02:44:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:04,367 INFO L225 Difference]: With dead ends: 46 [2025-03-09 02:44:04,367 INFO L226 Difference]: Without dead ends: 42 [2025-03-09 02:44:04,367 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:44:04,368 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:04,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 134 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:44:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-09 02:44:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-09 02:44:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 02:44:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-09 02:44:04,377 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 22 [2025-03-09 02:44:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:04,377 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-09 02:44:04,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:44:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-09 02:44:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:44:04,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:04,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:04,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:44:04,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:04,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2097554501, now seen corresponding path program 1 times [2025-03-09 02:44:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:04,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333595416] [2025-03-09 02:44:04,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:04,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:44:04,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:44:04,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:04,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:44:04,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:04,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333595416] [2025-03-09 02:44:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333595416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:04,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:04,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882790996] [2025-03-09 02:44:04,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:04,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:04,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:04,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:04,497 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:44:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:04,538 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2025-03-09 02:44:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:04,538 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), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-03-09 02:44:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:04,539 INFO L225 Difference]: With dead ends: 50 [2025-03-09 02:44:04,539 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 02:44:04,539 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:44:04,540 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:04,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 139 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:44:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 02:44:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-09 02:44:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 02:44:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-03-09 02:44:04,548 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 32 [2025-03-09 02:44:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:04,548 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-03-09 02:44:04,549 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), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:44:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-03-09 02:44:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:44:04,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:04,550 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:04,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:44:04,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:04,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2020370447, now seen corresponding path program 1 times [2025-03-09 02:44:04,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:04,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865791874] [2025-03-09 02:44:04,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:04,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:04,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:44:04,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:44:04,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:04,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:44:04,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:04,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865791874] [2025-03-09 02:44:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865791874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:44:04,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474413790] [2025-03-09 02:44:04,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:04,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:04,932 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:44:04,934 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:44:04,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:44:05,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:44:05,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:05,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:05,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 02:44:05,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:05,051 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:44:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:44:05,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:44:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:44:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474413790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:44:05,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:44:05,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2025-03-09 02:44:05,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812329654] [2025-03-09 02:44:05,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:44:05,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 02:44:05,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:05,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 02:44:05,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:44:05,735 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 24 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-09 02:44:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:05,942 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2025-03-09 02:44:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:44:05,943 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 40 [2025-03-09 02:44:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:05,944 INFO L225 Difference]: With dead ends: 94 [2025-03-09 02:44:05,944 INFO L226 Difference]: Without dead ends: 52 [2025-03-09 02:44:05,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:44:05,946 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:05,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 237 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-09 02:44:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-09 02:44:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-09 02:44:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-03-09 02:44:05,957 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 40 [2025-03-09 02:44:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:05,957 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-03-09 02:44:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 21 states have internal predecessors, (46), 7 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-09 02:44:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-03-09 02:44:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 02:44:05,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:05,960 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:05,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:44:06,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:06,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:06,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash 64684373, now seen corresponding path program 2 times [2025-03-09 02:44:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907072383] [2025-03-09 02:44:06,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:44:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:06,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-09 02:44:06,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:44:06,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:44:06,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 11 proven. 106 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 02:44:07,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:07,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907072383] [2025-03-09 02:44:07,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907072383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:44:07,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121476425] [2025-03-09 02:44:07,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:44:07,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:07,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:07,035 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:44:07,037 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:44:07,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-09 02:44:07,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:44:07,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:44:07,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:07,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 02:44:07,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:07,170 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:44:07,324 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:44:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-09 02:44:07,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:07,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121476425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:07,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:44:07,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2025-03-09 02:44:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336182952] [2025-03-09 02:44:07,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:07,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:07,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:07,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:44:07,343 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:44:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:07,455 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-03-09 02:44:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:44:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 68 [2025-03-09 02:44:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:07,457 INFO L225 Difference]: With dead ends: 55 [2025-03-09 02:44:07,457 INFO L226 Difference]: Without dead ends: 54 [2025-03-09 02:44:07,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:44:07,458 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:07,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 89 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-09 02:44:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-03-09 02:44:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-09 02:44:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-03-09 02:44:07,467 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 68 [2025-03-09 02:44:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:07,467 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-03-09 02:44:07,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:44:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-03-09 02:44:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 02:44:07,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:07,469 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:07,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:44:07,673 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,SelfDestructingSolverStorable7 [2025-03-09 02:44:07,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:07,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:07,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2005215543, now seen corresponding path program 1 times [2025-03-09 02:44:07,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:07,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067303510] [2025-03-09 02:44:07,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:07,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:07,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:44:07,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:44:07,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:07,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-09 02:44:07,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:07,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067303510] [2025-03-09 02:44:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067303510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:44:07,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96940428] [2025-03-09 02:44:07,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:07,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:07,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:08,001 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:44:08,003 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:44:08,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 02:44:08,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 02:44:08,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:08,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:08,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:44:08,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:08,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-09 02:44:08,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:08,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96940428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:08,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:44:08,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-09 02:44:08,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890042210] [2025-03-09 02:44:08,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:08,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:08,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:08,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:08,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:44:08,206 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:44:12,254 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:44:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:12,270 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-03-09 02:44:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:44:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 69 [2025-03-09 02:44:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:12,271 INFO L225 Difference]: With dead ends: 51 [2025-03-09 02:44:12,271 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 02:44:12,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:44:12,272 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:12,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-09 02:44:12,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 02:44:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-03-09 02:44:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-09 02:44:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-09 02:44:12,284 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 69 [2025-03-09 02:44:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:12,285 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-09 02:44:12,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:44:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-09 02:44:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-09 02:44:12,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:12,286 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:12,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:44:12,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:12,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:12,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:12,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2002670203, now seen corresponding path program 1 times [2025-03-09 02:44:12,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613761192] [2025-03-09 02:44:12,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:12,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 02:44:12,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 02:44:12,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:12,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-09 02:44:12,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:12,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613761192] [2025-03-09 02:44:12,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613761192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:44:12,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100133474] [2025-03-09 02:44:12,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:12,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:12,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:12,811 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:44:12,812 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:44:12,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-09 02:44:12,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-09 02:44:12,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:12,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:12,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-09 02:44:12,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:12,934 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:44:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-09 02:44:13,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:44:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 104 proven. 33 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-09 02:44:15,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100133474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:44:15,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:44:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 21] total 39 [2025-03-09 02:44:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202642399] [2025-03-09 02:44:15,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:44:15,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-09 02:44:15,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:15,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-09 02:44:15,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2025-03-09 02:44:15,064 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 39 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 33 states have internal predecessors, (72), 11 states have call successors, (19), 8 states have call predecessors, (19), 12 states have return successors, (19), 10 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-09 02:44:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:15,699 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2025-03-09 02:44:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 02:44:15,703 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 33 states have internal predecessors, (72), 11 states have call successors, (19), 8 states have call predecessors, (19), 12 states have return successors, (19), 10 states have call predecessors, (19), 11 states have call successors, (19) Word has length 91 [2025-03-09 02:44:15,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:15,704 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:44:15,704 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 02:44:15,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=421, Invalid=2335, Unknown=0, NotChecked=0, Total=2756 [2025-03-09 02:44:15,705 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:15,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 198 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:44:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 02:44:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-09 02:44:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-09 02:44:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-09 02:44:15,720 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 91 [2025-03-09 02:44:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:15,720 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-09 02:44:15,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 33 states have internal predecessors, (72), 11 states have call successors, (19), 8 states have call predecessors, (19), 12 states have return successors, (19), 10 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-09 02:44:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-09 02:44:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-09 02:44:15,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:15,723 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:15,729 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:44:15,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:15,924 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:15,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1906517413, now seen corresponding path program 2 times [2025-03-09 02:44:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:15,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389229105] [2025-03-09 02:44:15,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:44:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:15,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 187 statements into 2 equivalence classes. [2025-03-09 02:44:15,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 187 of 187 statements. [2025-03-09 02:44:15,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:44:15,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-03-09 02:44:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389229105] [2025-03-09 02:44:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389229105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:44:16,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954109305] [2025-03-09 02:44:16,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:44:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:16,479 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:44:16,480 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:44:16,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 187 statements into 2 equivalence classes. [2025-03-09 02:44:16,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 187 of 187 statements. [2025-03-09 02:44:16,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:44:16,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:16,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 02:44:16,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:16,656 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:44:16,871 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:44:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-09 02:44:16,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954109305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:16,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:44:16,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2025-03-09 02:44:16,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378324645] [2025-03-09 02:44:16,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:16,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:16,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:16,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:16,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:44:16,886 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 02:44:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:16,975 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-09 02:44:16,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:44:16,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 187 [2025-03-09 02:44:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:16,976 INFO L225 Difference]: With dead ends: 51 [2025-03-09 02:44:16,976 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 02:44:16,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:44:16,977 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:16,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:16,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 02:44:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2025-03-09 02:44:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-09 02:44:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-03-09 02:44:16,986 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 187 [2025-03-09 02:44:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:16,986 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-03-09 02:44:16,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 02:44:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-03-09 02:44:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-09 02:44:16,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:16,988 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:16,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:44:17,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 02:44:17,191 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2025-03-09 02:44:17,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1027502333, now seen corresponding path program 1 times [2025-03-09 02:44:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:17,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007829572] [2025-03-09 02:44:17,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:17,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-09 02:44:17,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-09 02:44:17,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:17,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-03-09 02:44:17,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:17,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007829572] [2025-03-09 02:44:17,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007829572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:44:17,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095748588] [2025-03-09 02:44:17,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:17,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:17,561 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:44:17,562 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:44:17,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-09 02:44:17,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-09 02:44:17,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:17,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:17,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:44:17,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:17,942 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:44:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2025-03-09 02:44:17,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095748588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:17,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:44:17,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-09 02:44:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144476182] [2025-03-09 02:44:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:17,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:17,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:17,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:44:17,963 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 02:44:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:18,028 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-03-09 02:44:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:44:18,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 188 [2025-03-09 02:44:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:18,029 INFO L225 Difference]: With dead ends: 49 [2025-03-09 02:44:18,029 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:44:18,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:44:18,030 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:18,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:44:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:44:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:44:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:44:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:44:18,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2025-03-09 02:44:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:18,031 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:44:18,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-09 02:44:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:44:18,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:44:18,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 02:44:18,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 02:44:18,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 02:44:18,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 02:44:18,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 02:44:18,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 02:44:18,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:44:18,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:18,240 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:18,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:44:58,483 WARN L286 SmtUtils]: Spent 40.19s on a formula simplification. DAG size of input: 73 DAG size of output: 56 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-09 02:45:43,041 WARN L286 SmtUtils]: Spent 44.16s on a formula simplification. DAG size of input: 100 DAG size of output: 39 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-09 02:45:43,252 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:45:43,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:45:43 BoogieIcfgContainer [2025-03-09 02:45:43,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:45:43,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:45:43,256 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:45:43,256 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:45:43,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:44:02" (3/4) ... [2025-03-09 02:45:43,259 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:45:43,262 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_23_to_23_0 [2025-03-09 02:45:43,263 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_22_to_23_0 [2025-03-09 02:45:43,263 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_22_0 [2025-03-09 02:45:43,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-09 02:45:43,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 02:45:43,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:45:43,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:45:43,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:45:43,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:45:43,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:45:43,317 INFO L158 Benchmark]: Toolchain (without parser) took 100943.98ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 111.0MB in the beginning and 293.0MB in the end (delta: -181.9MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2025-03-09 02:45:43,318 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:45:43,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.62ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 100.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:45:43,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.55ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:45:43,319 INFO L158 Benchmark]: Boogie Preprocessor took 42.62ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:45:43,319 INFO L158 Benchmark]: IcfgBuilder took 275.59ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 81.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:45:43,320 INFO L158 Benchmark]: TraceAbstraction took 100374.84ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 81.4MB in the beginning and 301.3MB in the end (delta: -219.9MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. [2025-03-09 02:45:43,320 INFO L158 Benchmark]: Witness Printer took 60.49ms. Allocated memory is still 369.1MB. Free memory was 301.3MB in the beginning and 293.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:45:43,321 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.62ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 100.2MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.55ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.62ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 98.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 275.59ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 81.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 100374.84ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 81.4MB in the beginning and 301.3MB in the end (delta: -219.9MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. * Witness Printer took 60.49ms. Allocated memory is still 369.1MB. Free memory was 301.3MB in the beginning and 293.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 58 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 1593 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1257 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1004 IncrementalHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 336 mSDtfsCounter, 1004 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 733 SyntacticMatches, 4 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=7, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1394 NumberOfCodeBlocks, 1394 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1505 ConstructedInterpolants, 222 QuantifiedInterpolants, 5432 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2897 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 5972/6196 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 02:45:43,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE