./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_nla-digbench/recursified_hard-ll.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfbeed813c4c61f00fa3f37e016718a299be7911d54e721c8910a31480a25397 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:04:33,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:04:33,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:04:33,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:04:33,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:04:33,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:04:33,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:04:33,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:04:33,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:04:33,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:04:33,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:04:33,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:04:33,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:04:33,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:04:33,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:04:33,652 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:04:33,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:04:33,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:04:33,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:04:33,653 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:04:33,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:04:33,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:04:33,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:04:33,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:04:33,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:04:33,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:04:33,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:04:33,653 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 ! 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 -> dfbeed813c4c61f00fa3f37e016718a299be7911d54e721c8910a31480a25397 [2025-02-08 10:04:33,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:04:33,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:04:33,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:04:33,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:04:33,869 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:04:33,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c [2025-02-08 10:04:35,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08789c540/1f7c6c7ed2d444779873905dd1fc38cd/FLAG1fb869547 [2025-02-08 10:04:35,268 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:04:35,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c [2025-02-08 10:04:35,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08789c540/1f7c6c7ed2d444779873905dd1fc38cd/FLAG1fb869547 [2025-02-08 10:04:35,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08789c540/1f7c6c7ed2d444779873905dd1fc38cd [2025-02-08 10:04:35,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:04:35,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:04:35,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:04:35,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:04:35,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:04:35,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3acf80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35, skipping insertion in model container [2025-02-08 10:04:35,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:04:35,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:04:35,837 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:04:35,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:04:35,874 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:04:35,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35 WrapperNode [2025-02-08 10:04:35,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:04:35,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:04:35,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:04:35,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:04:35,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,901 INFO L138 Inliner]: procedures = 17, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-02-08 10:04:35,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:04:35,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:04:35,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:04:35,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:04:35,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,934 INFO L175 MemorySlicer]: Split 49 memory accesses to 7 slices as follows [2, 9, 12, 5, 6, 7, 8]. 24 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 12 writes are split as follows [0, 3, 3, 1, 2, 1, 2]. [2025-02-08 10:04:35,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:04:35,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:04:35,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:04:35,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:04:35,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (1/1) ... [2025-02-08 10:04:35,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:04:35,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:35,974 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-08 10:04:35,979 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-08 10:04:35,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_41_to_51_0 [2025-02-08 10:04:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_41_to_51_0 [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_31_to_38_0 [2025-02-08 10:04:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_31_to_38_0 [2025-02-08 10:04:35,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:04:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:04:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:04:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 10:04:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 10:04:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:04:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:04:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:04:36,081 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:04:36,082 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:04:36,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: 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_~#r~0#1.base, main_~#r~0#1.offset);havoc main_~#r~0#1.base, main_~#r~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#p~0#1.base, main_~#p~0#1.offset);havoc main_~#p~0#1.base, main_~#p~0#1.offset;call ULTIMATE.dealloc(main_~#q~0#1.base, main_~#q~0#1.offset);havoc main_~#q~0#1.base, main_~#q~0#1.offset; [2025-02-08 10:04:36,366 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-02-08 10:04:36,366 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:04:36,376 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:04:36,376 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:04:36,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:04:36 BoogieIcfgContainer [2025-02-08 10:04:36,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:04:36,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:04:36,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:04:36,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:04:36,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:04:35" (1/3) ... [2025-02-08 10:04:36,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b77f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:04:36, skipping insertion in model container [2025-02-08 10:04:36,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:35" (2/3) ... [2025-02-08 10:04:36,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b77f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:04:36, skipping insertion in model container [2025-02-08 10:04:36,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:04:36" (3/3) ... [2025-02-08 10:04:36,386 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_hard-ll.c [2025-02-08 10:04:36,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:04:36,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_hard-ll.c that has 4 procedures, 88 locations, 1 initial locations, 0 loop locations, and 24 error locations. [2025-02-08 10:04:36,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:04:36,464 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;@1cc143e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:04:36,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-08 10:04:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 75 states have internal predecessors, (80), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 10:04:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 10:04:36,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:36,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:36,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_41_to_51_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:04:36,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:36,478 INFO L85 PathProgramCache]: Analyzing trace with hash 389291393, now seen corresponding path program 1 times [2025-02-08 10:04:36,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:36,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829742302] [2025-02-08 10:04:36,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:36,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:36,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 10:04:36,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 10:04:36,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:36,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:36,613 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-08 10:04:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829742302] [2025-02-08 10:04:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829742302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:36,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:36,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:04:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619807677] [2025-02-08 10:04:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 10:04:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:36,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 10:04:36,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 10:04:36,633 INFO L87 Difference]: Start difference. First operand has 88 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 75 states have internal predecessors, (80), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 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-08 10:04:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:36,651 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2025-02-08 10:04:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 10:04:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 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-08 10:04:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:36,657 INFO L225 Difference]: With dead ends: 174 [2025-02-08 10:04:36,657 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 10:04:36,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 10:04:36,661 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:36,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:04:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 10:04:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 10:04:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 70 states have internal predecessors, (71), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 10:04:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-02-08 10:04:36,689 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 12 [2025-02-08 10:04:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:36,689 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-02-08 10:04:36,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 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-08 10:04:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-02-08 10:04:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 10:04:36,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:36,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:36,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:04:36,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_31_to_38_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:04:36,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash 731850132, now seen corresponding path program 1 times [2025-02-08 10:04:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:36,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871377264] [2025-02-08 10:04:36,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:36,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:36,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 10:04:36,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 10:04:36,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:36,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:36,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513752863] [2025-02-08 10:04:36,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:36,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:36,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:36,750 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-08 10:04:36,758 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-08 10:04:36,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 10:04:36,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 10:04:36,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:36,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:36,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 10:04:36,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:36,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:36,998 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-02-08 10:04:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:04:37,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:37,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871377264] [2025-02-08 10:04:37,014 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513752863] [2025-02-08 10:04:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513752863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:37,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:37,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753713451] [2025-02-08 10:04:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:37,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:37,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:37,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:37,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:37,019 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:04:41,101 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-08 10:04:45,160 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-08 10:04:49,171 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-08 10:04:53,178 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-08 10:04:57,182 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-08 10:05:01,196 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-08 10:05:05,201 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-08 10:05:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:05,202 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2025-02-08 10:05:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-08 10:05:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:05,207 INFO L225 Difference]: With dead ends: 147 [2025-02-08 10:05:05,207 INFO L226 Difference]: Without dead ends: 146 [2025-02-08 10:05:05,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:05,208 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:05,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 407 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2025-02-08 10:05:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-08 10:05:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2025-02-08 10:05:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 94 states have internal predecessors, (104), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2025-02-08 10:05:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2025-02-08 10:05:05,218 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 19 [2025-02-08 10:05:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:05,218 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2025-02-08 10:05:05,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:05:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2025-02-08 10:05:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 10:05:05,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:05,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:05,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:05,419 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-08 10:05:05,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_31_to_38_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:05:05,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:05,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1212517640, now seen corresponding path program 1 times [2025-02-08 10:05:05,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:05,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669535316] [2025-02-08 10:05:05,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:05,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:05,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 10:05:05,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 10:05:05,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:05,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:05,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326355575] [2025-02-08 10:05:05,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:05,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:05,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:05,480 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-08 10:05:05,481 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-08 10:05:05,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 10:05:05,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 10:05:05,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:05,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:05,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 10:05:05,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:05,599 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-02-08 10:05:05,626 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-02-08 10:05:05,846 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-02-08 10:05:05,851 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-02-08 10:05:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 10:05:05,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:05,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:05,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669535316] [2025-02-08 10:05:05,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:05,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326355575] [2025-02-08 10:05:05,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326355575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:05,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:05,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 10:05:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293613287] [2025-02-08 10:05:05,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:05,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 10:05:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:05,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 10:05:05,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 10:05:05,875 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:05:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:06,155 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2025-02-08 10:05:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 10:05:06,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-02-08 10:05:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:06,157 INFO L225 Difference]: With dead ends: 146 [2025-02-08 10:05:06,157 INFO L226 Difference]: Without dead ends: 145 [2025-02-08 10:05:06,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-08 10:05:06,158 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:06,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 476 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-08 10:05:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2025-02-08 10:05:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 94 states have internal predecessors, (103), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2025-02-08 10:05:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2025-02-08 10:05:06,167 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 20 [2025-02-08 10:05:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:06,167 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2025-02-08 10:05:06,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:05:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2025-02-08 10:05:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:05:06,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:06,168 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:06,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:06,372 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-08 10:05:06,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_31_to_38_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:05:06,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash -722182711, now seen corresponding path program 1 times [2025-02-08 10:05:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983380506] [2025-02-08 10:05:06,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:06,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:05:06,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:05:06,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:06,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:05:06,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:06,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983380506] [2025-02-08 10:05:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983380506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:06,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210744004] [2025-02-08 10:05:06,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:06,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:06,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:06,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:06,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:06,661 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:05:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:06,770 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2025-02-08 10:05:06,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:06,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-02-08 10:05:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:06,772 INFO L225 Difference]: With dead ends: 118 [2025-02-08 10:05:06,774 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 10:05:06,774 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-02-08 10:05:06,775 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 31 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:06,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 325 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 10:05:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-02-08 10:05:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 94 states have internal predecessors, (103), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2025-02-08 10:05:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2025-02-08 10:05:06,792 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 28 [2025-02-08 10:05:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:06,792 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2025-02-08 10:05:06,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:05:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2025-02-08 10:05:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:05:06,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:06,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:06,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 10:05:06,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_31_to_38_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:05:06,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:06,795 INFO L85 PathProgramCache]: Analyzing trace with hash -912827543, now seen corresponding path program 1 times [2025-02-08 10:05:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:06,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158150607] [2025-02-08 10:05:06,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:06,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:06,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:06,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:06,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:05:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158150607] [2025-02-08 10:05:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158150607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:07,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530178905] [2025-02-08 10:05:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:07,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:07,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:07,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:07,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:07,217 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:05:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:07,329 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2025-02-08 10:05:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:07,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2025-02-08 10:05:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:07,331 INFO L225 Difference]: With dead ends: 115 [2025-02-08 10:05:07,331 INFO L226 Difference]: Without dead ends: 114 [2025-02-08 10:05:07,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:07,331 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 30 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:07,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 386 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-08 10:05:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-08 10:05:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 70 states have (on average 1.457142857142857) internal successors, (102), 93 states have internal predecessors, (102), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2025-02-08 10:05:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2025-02-08 10:05:07,347 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 29 [2025-02-08 10:05:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:07,347 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2025-02-08 10:05:07,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:05:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2025-02-08 10:05:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 10:05:07,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:07,348 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:07,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 10:05:07,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_31_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:05:07,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1767117255, now seen corresponding path program 1 times [2025-02-08 10:05:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830486537] [2025-02-08 10:05:07,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:07,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:05:07,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:05:07,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:07,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:05:07,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:07,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830486537] [2025-02-08 10:05:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830486537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:07,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:07,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252700144] [2025-02-08 10:05:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:07,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:07,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:07,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:07,514 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:05:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:07,596 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2025-02-08 10:05:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:07,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-02-08 10:05:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:07,597 INFO L225 Difference]: With dead ends: 120 [2025-02-08 10:05:07,598 INFO L226 Difference]: Without dead ends: 118 [2025-02-08 10:05:07,598 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-02-08 10:05:07,598 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 18 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:07,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 366 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-08 10:05:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-08 10:05:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 97 states have internal predecessors, (106), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2025-02-08 10:05:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2025-02-08 10:05:07,613 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2025-02-08 10:05:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:07,613 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2025-02-08 10:05:07,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:05:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2025-02-08 10:05:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 10:05:07,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:07,613 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:07,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 10:05:07,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_41_to_51_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:05:07,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash -388343954, now seen corresponding path program 1 times [2025-02-08 10:05:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:07,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510567699] [2025-02-08 10:05:07,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:07,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:07,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 10:05:07,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 10:05:07,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:07,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:07,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [153517310] [2025-02-08 10:05:07,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:07,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:07,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:07,666 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-08 10:05:07,668 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-08 10:05:07,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 10:05:07,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 10:05:07,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:07,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:07,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 10:05:07,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:07,798 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-08 10:05:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:05:07,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:07,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510567699] [2025-02-08 10:05:07,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:07,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153517310] [2025-02-08 10:05:07,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153517310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:07,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:07,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020986730] [2025-02-08 10:05:07,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:07,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:07,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:07,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:07,923 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 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-02-08 10:05:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:08,048 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2025-02-08 10:05:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:08,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 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 33 [2025-02-08 10:05:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:08,050 INFO L225 Difference]: With dead ends: 175 [2025-02-08 10:05:08,050 INFO L226 Difference]: Without dead ends: 173 [2025-02-08 10:05:08,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:08,050 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 131 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:08,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 301 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-08 10:05:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 145. [2025-02-08 10:05:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 119 states have internal predecessors, (135), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2025-02-08 10:05:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 179 transitions. [2025-02-08 10:05:08,067 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 179 transitions. Word has length 33 [2025-02-08 10:05:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:08,067 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 179 transitions. [2025-02-08 10:05:08,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 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-02-08 10:05:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2025-02-08 10:05:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 10:05:08,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:08,068 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:08,075 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-08 10:05:08,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:08,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_41_to_51_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:05:08,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:08,274 INFO L85 PathProgramCache]: Analyzing trace with hash 463615116, now seen corresponding path program 1 times [2025-02-08 10:05:08,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:08,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611008756] [2025-02-08 10:05:08,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:08,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:08,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 10:05:08,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 10:05:08,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:08,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat