./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a00615dde165ef79502be50d436d5b7101f564051a4b91f339855b18841d9599 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:07:10,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:07:10,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:07:10,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:07:10,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:07:10,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:07:10,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:07:10,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:07:10,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:07:10,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:07:10,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:07:10,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:07:10,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:07:10,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:07:10,256 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:07:10,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:07:10,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:07:10,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:07:10,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:07:10,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:07:10,258 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-jdk21/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 ! call(reach_error())) ) 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 -> a00615dde165ef79502be50d436d5b7101f564051a4b91f339855b18841d9599 [2025-02-07 21:07:10,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:07:10,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:07:10,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:07:10,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:07:10,514 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:07:10,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i [2025-02-07 21:07:11,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa4323851/5ed5a45acc9948d4b985014c17bbe31c/FLAG74f7850b1 [2025-02-07 21:07:12,015 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:07:12,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i [2025-02-07 21:07:12,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa4323851/5ed5a45acc9948d4b985014c17bbe31c/FLAG74f7850b1 [2025-02-07 21:07:12,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa4323851/5ed5a45acc9948d4b985014c17bbe31c [2025-02-07 21:07:12,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:07:12,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:07:12,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:07:12,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:07:12,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:07:12,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370b2188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12, skipping insertion in model container [2025-02-07 21:07:12,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:07:12,162 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i[1800,1813] [2025-02-07 21:07:12,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:07:12,179 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:07:12,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i[1800,1813] [2025-02-07 21:07:12,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:07:12,205 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:07:12,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12 WrapperNode [2025-02-07 21:07:12,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:07:12,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:07:12,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:07:12,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:07:12,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,228 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2025-02-07 21:07:12,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:07:12,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:07:12,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:07:12,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:07:12,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,250 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 2, 12]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 5 writes are split as follows [0, 1, 4]. [2025-02-07 21:07:12,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:07:12,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:07:12,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:07:12,264 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:07:12,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (1/1) ... [2025-02-07 21:07:12,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:07:12,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:07:12,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:07:12,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:07:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:07:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:07:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:07:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:07:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:07:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:07:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:07:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:07:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_41_0 [2025-02-07 21:07:12,310 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_41_0 [2025-02-07 21:07:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_44_to_45_0 [2025-02-07 21:07:12,311 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_44_to_45_0 [2025-02-07 21:07:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:07:12,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:07:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:07:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:07:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:07:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:07:12,363 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:07:12,370 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:07:12,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L72: SUMMARY for call func_to_recursive_line_44_to_45_0(~array#1.base, ~array#1.offset, ~index#1.base, ~index#1.offset); srcloc: null [2025-02-07 21:07:12,437 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc #t~mem2#1;havoc #t~mem3#1;havoc #t~mem4#1;call #t~mem5#1 := read~int#2(~index#1.base, ~index#1.offset, 4);#t~post6#1 := #t~mem5#1;call write~int#2(1 + #t~post6#1, ~index#1.base, ~index#1.offset, 4);havoc #t~mem5#1;havoc #t~post6#1; [2025-02-07 21:07:12,459 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-07 21:07:12,459 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:07:12,464 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:07:12,464 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:07:12,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:07:12 BoogieIcfgContainer [2025-02-07 21:07:12,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:07:12,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:07:12,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:07:12,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:07:12,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:07:12" (1/3) ... [2025-02-07 21:07:12,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b32eb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:07:12, skipping insertion in model container [2025-02-07 21:07:12,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:07:12" (2/3) ... [2025-02-07 21:07:12,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b32eb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:07:12, skipping insertion in model container [2025-02-07 21:07:12,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:07:12" (3/3) ... [2025-02-07 21:07:12,470 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_2.i [2025-02-07 21:07:12,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:07:12,480 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_simple_array_index_value_2.i that has 3 procedures, 22 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-07 21:07:12,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:07:12,514 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;@630b3900, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:07:12,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:07:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 21:07:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 21:07:12,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:12,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:12,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:12,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1273844544, now seen corresponding path program 1 times [2025-02-07 21:07:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:12,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286113939] [2025-02-07 21:07:12,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:07:12,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:12,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 21:07:12,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 21:07:12,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:07:12,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:07:12,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:07:12,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286113939] [2025-02-07 21:07:12,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286113939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:07:12,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:07:12,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:07:12,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917506486] [2025-02-07 21:07:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:07:12,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:07:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:07:12,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:07:12,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:07:12,942 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 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-02-07 21:07:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:07:13,017 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-02-07 21:07:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:07:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 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-02-07 21:07:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:07:13,024 INFO L225 Difference]: With dead ends: 44 [2025-02-07 21:07:13,025 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 21:07:13,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:07:13,031 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:07:13,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:07:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 21:07:13,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-07 21:07:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 21:07:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-02-07 21:07:13,060 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2025-02-07 21:07:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:07:13,061 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-02-07 21:07:13,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 4 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-02-07 21:07:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-02-07 21:07:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 21:07:13,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:13,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:13,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:07:13,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:13,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1309257282, now seen corresponding path program 1 times [2025-02-07 21:07:13,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:13,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380870282] [2025-02-07 21:07:13,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:07:13,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:13,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 21:07:13,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 21:07:13,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:07:13,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 21:07:13,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:07:13,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380870282] [2025-02-07 21:07:13,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380870282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:13,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845369126] [2025-02-07 21:07:13,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:07:13,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:13,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:07:13,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:07:13,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 21:07:13,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 21:07:13,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 21:07:13,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:07:13,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:13,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 21:07:13,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:07:13,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 21:07:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 21:07:13,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:07:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:07:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845369126] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:07:14,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:07:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-02-07 21:07:14,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969040671] [2025-02-07 21:07:14,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:07:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 21:07:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:07:14,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 21:07:14,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:07:14,265 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 21 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 21:07:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:07:14,430 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-02-07 21:07:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:07:14,430 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 19 [2025-02-07 21:07:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:07:14,431 INFO L225 Difference]: With dead ends: 27 [2025-02-07 21:07:14,431 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 21:07:14,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-02-07 21:07:14,432 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:07:14,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:07:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 21:07:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-07 21:07:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 21:07:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-02-07 21:07:14,435 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2025-02-07 21:07:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:07:14,436 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-02-07 21:07:14,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 21:07:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-02-07 21:07:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 21:07:14,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:14,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:14,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 21:07:14,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:14,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:14,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1621427398, now seen corresponding path program 2 times [2025-02-07 21:07:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:14,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835448853] [2025-02-07 21:07:14,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:07:14,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:14,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-07 21:07:14,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 21:07:14,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:07:14,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 21:07:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:07:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835448853] [2025-02-07 21:07:15,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835448853] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135741395] [2025-02-07 21:07:15,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:07:15,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:15,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:07:15,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:07:15,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 21:07:15,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-07 21:07:15,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 21:07:15,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 21:07:15,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:15,199 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-02-07 21:07:15,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:07:15,214 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-02-07 21:07:15,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2025-02-07 21:07:15,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 118 [2025-02-07 21:07:15,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 16 [2025-02-07 21:07:15,972 INFO L349 Elim1Store]: treesize reduction 122, result has 42.2 percent of original size [2025-02-07 21:07:15,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 120 [2025-02-07 21:07:16,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-07 21:07:16,459 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-02-07 21:07:16,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:07:16,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2025-02-07 21:07:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:07:16,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:07:17,490 INFO L349 Elim1Store]: treesize reduction 98, result has 60.3 percent of original size [2025-02-07 21:07:17,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 187 [2025-02-07 21:07:17,640 INFO L349 Elim1Store]: treesize reduction 5, result has 90.4 percent of original size [2025-02-07 21:07:17,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 282 treesize of output 247 [2025-02-07 21:07:17,786 INFO L349 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2025-02-07 21:07:17,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 345 treesize of output 214 [2025-02-07 21:07:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135741395] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:18,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:07:18,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20] total 29 [2025-02-07 21:07:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653367231] [2025-02-07 21:07:18,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:07:18,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 21:07:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:07:18,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 21:07:18,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1277, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 21:07:18,210 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 30 states, 23 states have (on average 1.608695652173913) internal successors, (37), 25 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 21:07:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:07:19,234 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-02-07 21:07:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:07:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 1.608695652173913) internal successors, (37), 25 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2025-02-07 21:07:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:07:19,235 INFO L225 Difference]: With dead ends: 36 [2025-02-07 21:07:19,235 INFO L226 Difference]: Without dead ends: 29 [2025-02-07 21:07:19,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=267, Invalid=2283, Unknown=0, NotChecked=0, Total=2550 [2025-02-07 21:07:19,237 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:07:19,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 86 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:07:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-07 21:07:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-07 21:07:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-07 21:07:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-02-07 21:07:19,244 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 26 [2025-02-07 21:07:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:07:19,244 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-02-07 21:07:19,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 1.608695652173913) internal successors, (37), 25 states have internal predecessors, (37), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 21:07:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-02-07 21:07:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 21:07:19,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:19,245 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:19,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 21:07:19,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:19,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:19,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1496649720, now seen corresponding path program 3 times [2025-02-07 21:07:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:19,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599094981] [2025-02-07 21:07:19,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:07:19,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:19,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-02-07 21:07:19,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:07:19,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 21:07:19,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 21:07:19,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:07:19,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599094981] [2025-02-07 21:07:19,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599094981] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:19,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729036619] [2025-02-07 21:07:19,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 21:07:19,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:07:19,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:07:19,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 21:07:20,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-02-07 21:07:20,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:07:20,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 21:07:20,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:20,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-02-07 21:07:20,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:07:20,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 21:07:20,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2025-02-07 21:07:20,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 126 [2025-02-07 21:07:20,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 15 [2025-02-07 21:07:20,585 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 72 treesize of output 52 [2025-02-07 21:07:20,697 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 72 treesize of output 52 [2025-02-07 21:07:20,711 WARN L873 $PredicateComparison]: unable to prove that (exists ((|func_to_recursive_line_38_to_41_0_~array#1.offset| Int) (v_z_20 Int)) (let ((.cse1 (+ |func_to_recursive_line_38_to_41_0_~array#1.offset| (* v_z_20 4)))) (let ((.cse0 (select (select |c_#memory_int#1| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse1))) (and (<= |func_to_recursive_line_38_to_41_0_~array#1.offset| |c_func_to_recursive_line_38_to_41_0_#in~array#1.offset|) (<= (+ v_z_20 1) (mod .cse0 4294967296)) (<= v_z_20 9999) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base| (store (select |c_old(#memory_int#1)| |c_func_to_recursive_line_38_to_41_0_#in~array#1.base|) .cse1 .cse0))) (<= 0 v_z_20))))) is different from true [2025-02-07 21:07:21,078 INFO L349 Elim1Store]: treesize reduction 349, result has 36.3 percent of original size [2025-02-07 21:07:21,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 225 treesize of output 385 [2025-02-07 21:07:22,191 INFO L349 Elim1Store]: treesize reduction 16, result has 85.0 percent of original size [2025-02-07 21:07:22,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 119 [2025-02-07 21:07:22,422 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 21:07:23,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2025-02-07 21:07:23,062 INFO L349 Elim1Store]: treesize reduction 23, result has 50.0 percent of original size [2025-02-07 21:07:23,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 41 [2025-02-07 21:07:23,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2025-02-07 21:07:23,111 INFO L349 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2025-02-07 21:07:23,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 40 [2025-02-07 21:07:23,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2025-02-07 21:07:23,156 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-02-07 21:07:23,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 18 [2025-02-07 21:07:23,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2025-02-07 21:07:23,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:07:23,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 63 [2025-02-07 21:07:23,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2025-02-07 21:07:23,264 INFO L349 Elim1Store]: treesize reduction 24, result has 47.8 percent of original size [2025-02-07 21:07:23,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 40 [2025-02-07 21:07:23,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2025-02-07 21:07:23,308 INFO L349 Elim1Store]: treesize reduction 23, result has 50.0 percent of original size [2025-02-07 21:07:23,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 41 [2025-02-07 21:07:23,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2025-02-07 21:07:23,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 22 [2025-02-07 21:07:23,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2025-02-07 21:07:23,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 22 [2025-02-07 21:07:23,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2025-02-07 21:07:23,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 22 [2025-02-07 21:07:23,448 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 21:07:23,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2025-02-07 21:07:23,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 22 [2025-02-07 21:07:23,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2025-02-07 21:07:23,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 22 [2025-02-07 21:07:23,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2025-02-07 21:07:23,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 21 [2025-02-07 21:07:23,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2025-02-07 21:07:23,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 21 [2025-02-07 21:07:23,964 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 21:07:24,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-07 21:07:24,561 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-02-07 21:07:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2025-02-07 21:07:24,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:07:25,686 INFO L349 Elim1Store]: treesize reduction 305, result has 46.0 percent of original size [2025-02-07 21:07:25,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 298 [2025-02-07 21:07:25,707 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 246 treesize of output 214 [2025-02-07 21:07:25,734 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 256 treesize of output 220 [2025-02-07 21:07:25,831 INFO L349 Elim1Store]: treesize reduction 10, result has 89.2 percent of original size [2025-02-07 21:07:25,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 205 [2025-02-07 21:07:25,912 INFO L349 Elim1Store]: treesize reduction 5, result has 93.7 percent of original size [2025-02-07 21:07:25,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 160 [2025-02-07 21:07:26,314 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 73 treesize of output 61 [2025-02-07 21:07:26,323 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 67 treesize of output 55 [2025-02-07 21:07:26,597 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 54 treesize of output 42 [2025-02-07 21:07:30,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729036619] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:30,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 21:07:30,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2025-02-07 21:07:30,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178615807] [2025-02-07 21:07:30,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 21:07:30,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-07 21:07:30,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:07:30,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-07 21:07:30,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1428, Unknown=5, NotChecked=76, Total=1640 [2025-02-07 21:07:30,748 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 32 states, 25 states have (on average 1.6) internal successors, (40), 28 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-07 21:07:37,505 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-02-07 21:07:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:07:42,164 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-02-07 21:07:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:07:42,164 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 1.6) internal successors, (40), 28 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 33 [2025-02-07 21:07:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:07:42,167 INFO L225 Difference]: With dead ends: 42 [2025-02-07 21:07:42,167 INFO L226 Difference]: Without dead ends: 31 [2025-02-07 21:07:42,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=301, Invalid=2559, Unknown=6, NotChecked=104, Total=2970 [2025-02-07 21:07:42,172 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:07:42,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 120 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 415 Invalid, 1 Unknown, 27 Unchecked, 5.2s Time] [2025-02-07 21:07:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-07 21:07:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-02-07 21:07:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-07 21:07:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-02-07 21:07:42,186 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 33 [2025-02-07 21:07:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:07:42,187 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-02-07 21:07:42,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 1.6) internal successors, (40), 28 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-07 21:07:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-02-07 21:07:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 21:07:42,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:07:42,187 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:07:42,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 21:07:42,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:42,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_44_to_45_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:07:42,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:07:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1611097268, now seen corresponding path program 4 times [2025-02-07 21:07:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:07:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217154569] [2025-02-07 21:07:42,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:07:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:07:42,401 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-02-07 21:07:42,416 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 21:07:42,417 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:07:42,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 21:07:43,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:07:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217154569] [2025-02-07 21:07:43,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217154569] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:07:43,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884007007] [2025-02-07 21:07:43,054 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 21:07:43,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:07:43,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:07:43,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:07:43,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 21:07:43,127 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-02-07 21:07:43,166 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 21:07:43,166 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 21:07:43,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:07:43,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-07 21:07:43,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:07:43,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 21:07:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-07 21:07:43,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:08:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:08:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884007007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:08:08,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:08:08,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 21] total 40 [2025-02-07 21:08:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375637552] [2025-02-07 21:08:08,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:08:08,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-07 21:08:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:08:08,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-07 21:08:08,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1449, Unknown=6, NotChecked=0, Total=1640 [2025-02-07 21:08:08,935 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 41 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 34 states have internal predecessors, (53), 11 states have call successors, (11), 7 states have call predecessors, (11), 15 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2025-02-07 21:08:25,179 WARN L286 SmtUtils]: Spent 16.12s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 21:08:29,320 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 [] [2025-02-07 21:08:33,336 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 [] [2025-02-07 21:08:37,340 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 [] [2025-02-07 21:08:41,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:08:45,358 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 [] [2025-02-07 21:08:49,367 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 []