./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_mannadiv.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_mannadiv.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 305ef194ca8c72f4da0a6deb18ed40b72305718d65c18a21aa3fcb3830c499e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:45:54,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:45:54,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:45:54,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:45:54,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:45:54,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:45:54,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:45:54,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:45:54,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:45:54,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:45:54,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:45:54,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:45:54,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:45:54,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:45:54,933 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:45:54,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:45:54,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:45:54,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:45:54,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:45:54,935 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 305ef194ca8c72f4da0a6deb18ed40b72305718d65c18a21aa3fcb3830c499e5 [2025-03-09 02:45:55,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:45:55,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:45:55,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:45:55,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:45:55,176 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:45:55,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_mannadiv.c [2025-03-09 02:45:56,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa349747/b7a1c2fbf87141cc93341dac66181264/FLAGedb9f8322 [2025-03-09 02:45:56,493 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:45:56,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_mannadiv.c [2025-03-09 02:45:56,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa349747/b7a1c2fbf87141cc93341dac66181264/FLAGedb9f8322 [2025-03-09 02:45:56,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fa349747/b7a1c2fbf87141cc93341dac66181264 [2025-03-09 02:45:56,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:45:56,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:45:56,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:45:56,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:45:56,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:45:56,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f8c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56, skipping insertion in model container [2025-03-09 02:45:56,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:45:56,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:45:56,666 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:45:56,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:45:56,695 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:45:56,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56 WrapperNode [2025-03-09 02:45:56,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:45:56,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:45:56,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:45:56,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:45:56,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,719 INFO L138 Inliner]: procedures = 16, calls = 58, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-03-09 02:45:56,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:45:56,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:45:56,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:45:56,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:45:56,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,744 INFO L175 MemorySlicer]: Split 31 memory accesses to 6 slices as follows [2, 5, 5, 7, 7, 5]. 23 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 2, 1, 3, 3, 1]. [2025-03-09 02:45:56,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:45:56,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:45:56,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:45:56,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:45:56,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (1/1) ... [2025-03-09 02:45:56,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:45:56,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:56,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:45:56,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:45:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:45:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 02:45:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:45:56,805 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_31_to_42_0 [2025-03-09 02:45:56,806 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_31_to_42_0 [2025-03-09 02:45:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:45:56,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:45:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:45:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:45:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:45:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:45:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:45:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:45:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:45:56,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:45:56,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:45:56,883 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:45:56,885 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:45:57,095 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: call ULTIMATE.dealloc(main_~#x1~0#1.base, main_~#x1~0#1.offset);havoc main_~#x1~0#1.base, main_~#x1~0#1.offset;call ULTIMATE.dealloc(main_~#x2~0#1.base, main_~#x2~0#1.offset);havoc main_~#x2~0#1.base, main_~#x2~0#1.offset;call ULTIMATE.dealloc(main_~#y1~0#1.base, main_~#y1~0#1.offset);havoc main_~#y1~0#1.base, main_~#y1~0#1.offset;call ULTIMATE.dealloc(main_~#y2~0#1.base, main_~#y2~0#1.offset);havoc main_~#y2~0#1.base, main_~#y2~0#1.offset;call ULTIMATE.dealloc(main_~#y3~0#1.base, main_~#y3~0#1.offset);havoc main_~#y3~0#1.base, main_~#y3~0#1.offset; [2025-03-09 02:45:57,112 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-09 02:45:57,113 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:45:57,123 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:45:57,123 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:45:57,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:45:57 BoogieIcfgContainer [2025-03-09 02:45:57,124 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:45:57,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:45:57,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:45:57,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:45:57,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:45:56" (1/3) ... [2025-03-09 02:45:57,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e58a227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:45:57, skipping insertion in model container [2025-03-09 02:45:57,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:56" (2/3) ... [2025-03-09 02:45:57,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e58a227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:45:57, skipping insertion in model container [2025-03-09 02:45:57,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:45:57" (3/3) ... [2025-03-09 02:45:57,132 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_mannadiv.c [2025-03-09 02:45:57,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:45:57,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_mannadiv.c that has 4 procedures, 72 locations, 1 initial locations, 0 loop locations, and 20 error locations. [2025-03-09 02:45:57,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:45:57,186 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;@79c1f27e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:45:57,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-09 02:45:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 63 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-09 02:45:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:45:57,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:57,193 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:57,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_31_to_42_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_31_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_31_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 02:45:57,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:57,198 INFO L85 PathProgramCache]: Analyzing trace with hash -341130365, now seen corresponding path program 1 times [2025-03-09 02:45:57,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:57,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10688745] [2025-03-09 02:45:57,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:57,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:57,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:45:57,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:45:57,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:57,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:45:57,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:57,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10688745] [2025-03-09 02:45:57,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10688745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:45:57,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870602550] [2025-03-09 02:45:57,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:57,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:57,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:57,340 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:57,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:45:57,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:45:57,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:45:57,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:57,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:57,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 02:45:57,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:45:57,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:45:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870602550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:57,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:45:57,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-09 02:45:57,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255859910] [2025-03-09 02:45:57,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:57,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:45:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:57,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:45:57,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:45:57,454 INFO L87 Difference]: Start difference. First operand has 72 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 63 states have internal predecessors, (67), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:45:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:57,467 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2025-03-09 02:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:45:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-09 02:45:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:57,472 INFO L225 Difference]: With dead ends: 140 [2025-03-09 02:45:57,472 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 02:45:57,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:45:57,476 INFO L435 NwaCegarLoop]: 75 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, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:57,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:45:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 02:45:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-09 02:45:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 57 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:45:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2025-03-09 02:45:57,506 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 18 [2025-03-09 02:45:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:57,507 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2025-03-09 02:45:57,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:45:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2025-03-09 02:45:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:45:57,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:57,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:57,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:45:57,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-09 02:45:57,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_31_to_42_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_31_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_31_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 02:45:57,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash 896121345, now seen corresponding path program 1 times [2025-03-09 02:45:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828024143] [2025-03-09 02:45:57,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:57,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:57,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:45:57,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:45:57,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:57,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:57,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292777956] [2025-03-09 02:45:57,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:57,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:57,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:57,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:57,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:45:57,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:45:57,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:45:57,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:57,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:57,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 02:45:57,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:57,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:45:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:45:57,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:45:57,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:57,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828024143] [2025-03-09 02:45:57,958 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292777956] [2025-03-09 02:45:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292777956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:57,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:57,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:45:57,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759593103] [2025-03-09 02:45:57,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:57,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:45:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:57,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:45:57,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:45:57,959 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:45:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:58,090 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2025-03-09 02:45:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:45:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-09 02:45:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:58,094 INFO L225 Difference]: With dead ends: 105 [2025-03-09 02:45:58,094 INFO L226 Difference]: Without dead ends: 103 [2025-03-09 02:45:58,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:45:58,095 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 72 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:58,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 263 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:45:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-09 02:45:58,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2025-03-09 02:45:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 77 states have internal predecessors, (89), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-09 02:45:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2025-03-09 02:45:58,128 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 18 [2025-03-09 02:45:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:58,128 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2025-03-09 02:45:58,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:45:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2025-03-09 02:45:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:45:58,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:58,129 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:58,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:45:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-09 02:45:58,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_31_to_42_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_31_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_31_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 02:45:58,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2115813729, now seen corresponding path program 1 times [2025-03-09 02:45:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:58,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392280476] [2025-03-09 02:45:58,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:58,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:45:58,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:45:58,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:58,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:45:58,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:58,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392280476] [2025-03-09 02:45:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392280476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:58,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:58,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:45:58,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290098361] [2025-03-09 02:45:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:58,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:45:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:58,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:45:58,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:45:58,616 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:45:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:58,761 INFO L93 Difference]: Finished difference Result 151 states and 190 transitions. [2025-03-09 02:45:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:45:58,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-09 02:45:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:58,763 INFO L225 Difference]: With dead ends: 151 [2025-03-09 02:45:58,763 INFO L226 Difference]: Without dead ends: 150 [2025-03-09 02:45:58,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:45:58,763 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:58,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 270 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:45:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-09 02:45:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 115. [2025-03-09 02:45:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 100 states have internal predecessors, (121), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2025-03-09 02:45:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2025-03-09 02:45:58,780 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 20 [2025-03-09 02:45:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:58,780 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2025-03-09 02:45:58,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:45:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2025-03-09 02:45:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 02:45:58,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:58,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:58,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:45:58,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_31_to_42_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_31_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_31_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 02:45:58,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:58,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1165716156, now seen corresponding path program 1 times [2025-03-09 02:45:58,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:58,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960714533] [2025-03-09 02:45:58,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:58,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:58,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 02:45:58,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 02:45:58,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:58,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:45:58,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:58,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960714533] [2025-03-09 02:45:58,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960714533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:58,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:58,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:45:58,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769764177] [2025-03-09 02:45:58,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:58,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:45:58,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:58,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:45:58,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:45:58,950 INFO L87 Difference]: Start difference. First operand 115 states and 146 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:45:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:59,093 INFO L93 Difference]: Finished difference Result 150 states and 188 transitions. [2025-03-09 02:45:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:45:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 21 [2025-03-09 02:45:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:59,095 INFO L225 Difference]: With dead ends: 150 [2025-03-09 02:45:59,095 INFO L226 Difference]: Without dead ends: 149 [2025-03-09 02:45:59,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:45:59,095 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:59,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 261 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:45:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-09 02:45:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 115. [2025-03-09 02:45:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 100 states have internal predecessors, (119), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2025-03-09 02:45:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 144 transitions. [2025-03-09 02:45:59,104 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 144 transitions. Word has length 21 [2025-03-09 02:45:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:59,104 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 144 transitions. [2025-03-09 02:45:59,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:45:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 144 transitions. [2025-03-09 02:45:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 02:45:59,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:59,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:59,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:45:59,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_31_to_42_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_31_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_31_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-09 02:45:59,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1777462467, now seen corresponding path program 1 times [2025-03-09 02:45:59,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:59,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492303139] [2025-03-09 02:45:59,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:59,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:45:59,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:45:59,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:59,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat