./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/rm-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/busybox-1.22.0/rm-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 90737e7de37f377d29635b0f8c6eb5502f274919cfcd178c0f93945dfec4ae40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:01:17,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:01:17,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 18:01:17,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:01:17,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:01:17,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:01:17,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:01:17,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:01:17,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:01:17,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:01:17,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:01:17,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:01:17,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:01:17,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:01:17,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:01:17,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:01:17,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:01:17,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:01:17,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:01:17,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:01:17,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:01:17,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:01:17,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:01:17,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:01:17,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:01:17,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:01:17,360 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90737e7de37f377d29635b0f8c6eb5502f274919cfcd178c0f93945dfec4ae40 [2025-02-06 18:01:17,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:01:17,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:01:17,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:01:17,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:01:17,680 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:01:17,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/rm-2.i [2025-02-06 18:01:19,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a48ee517/3e1b2df927094084829f8f609d60de45/FLAG3c58f336f [2025-02-06 18:01:19,570 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:01:19,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/rm-2.i [2025-02-06 18:01:19,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a48ee517/3e1b2df927094084829f8f609d60de45/FLAG3c58f336f [2025-02-06 18:01:19,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a48ee517/3e1b2df927094084829f8f609d60de45 [2025-02-06 18:01:19,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:01:19,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:01:19,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:19,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:01:19,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:01:19,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:19" (1/1) ... [2025-02-06 18:01:19,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467bac91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:19, skipping insertion in model container [2025-02-06 18:01:19,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:19" (1/1) ... [2025-02-06 18:01:19,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:01:20,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:20,994 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:01:21,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:21,329 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 18:01:21,360 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:01:21,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21 WrapperNode [2025-02-06 18:01:21,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:21,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:21,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:01:21,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:01:21,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,500 INFO L138 Inliner]: procedures = 665, calls = 1116, calls flagged for inlining = 33, calls inlined = 32, statements flattened = 2806 [2025-02-06 18:01:21,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:21,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:01:21,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:01:21,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:01:21,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,533 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 18:01:21,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:01:21,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:01:21,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:01:21,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:01:21,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (1/1) ... [2025-02-06 18:01:21,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:01:21,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:21,690 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-06 18:01:21,694 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-06 18:01:21,710 INFO L130 BoogieDeclarations]: Found specification of procedure last_char_is [2025-02-06 18:01:21,711 INFO L138 BoogieDeclarations]: Found implementation of procedure last_char_is [2025-02-06 18:01:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-02-06 18:01:21,711 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-02-06 18:01:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:01:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 18:01:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 18:01:21,712 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 18:01:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 18:01:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 18:01:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ask_confirmation [2025-02-06 18:01:21,712 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ask_confirmation [2025-02-06 18:01:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:01:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:01:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 18:01:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:01:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:01:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 18:01:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 18:01:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-06 18:01:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-06 18:01:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 18:01:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 18:01:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure remove_file [2025-02-06 18:01:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_file [2025-02-06 18:01:21,713 INFO L130 BoogieDeclarations]: Found specification of procedure access [2025-02-06 18:01:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure access [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-06 18:01:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 18:01:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-06 18:01:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-02-06 18:01:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure isatty [2025-02-06 18:01:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isatty [2025-02-06 18:01:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 18:01:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 18:01:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 18:01:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-02-06 18:01:21,715 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-02-06 18:01:22,138 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:01:22,139 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:01:22,205 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3564: havoc #t~nondet287; [2025-02-06 18:01:22,778 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: havoc ~dp~0#1.base, ~dp~0#1.offset, ~d~0#1.base, ~d~0#1.offset, ~status~0#1, ~return_value_closedir$8~0#1, ~return_value_rmdir$10~0#1; [2025-02-06 18:01:22,778 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3656: havoc lstat_#t~ret332#1; [2025-02-06 18:01:22,778 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3203: call ULTIMATE.dealloc(~#path_stat~0#1.base, ~#path_stat~0#1.offset);havoc ~#path_stat~0#1.base, ~#path_stat~0#1.offset; [2025-02-06 18:01:22,778 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443: havoc xasprintf_#t~mem260#1.base, xasprintf_#t~mem260#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-02-06 18:01:22,779 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3652: havoc stat_#t~ret331#1; [2025-02-06 18:01:24,235 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-06 18:01:24,235 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3713: havoc getopt_long_#t~ret364#1; [2025-02-06 18:01:24,524 INFO L? ?]: Removed 780 outVars from TransFormulas that were not future-live. [2025-02-06 18:01:24,524 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:01:24,607 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:01:24,607 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:01:24,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:24 BoogieIcfgContainer [2025-02-06 18:01:24,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:01:24,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:01:24,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:01:24,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:01:24,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:01:19" (1/3) ... [2025-02-06 18:01:24,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a10516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:24, skipping insertion in model container [2025-02-06 18:01:24,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:21" (2/3) ... [2025-02-06 18:01:24,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a10516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:24, skipping insertion in model container [2025-02-06 18:01:24,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:24" (3/3) ... [2025-02-06 18:01:24,617 INFO L128 eAbstractionObserver]: Analyzing ICFG rm-2.i [2025-02-06 18:01:24,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:01:24,630 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rm-2.i that has 16 procedures, 719 locations, 1 initial locations, 34 loop locations, and 70 error locations. [2025-02-06 18:01:24,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:01:24,717 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;@7b8e4651, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:01:24,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-02-06 18:01:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 719 states, 583 states have (on average 1.6157804459691252) internal successors, (942), 659 states have internal predecessors, (942), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 18:01:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 18:01:24,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:24,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 18:01:24,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:24,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash 37463103, now seen corresponding path program 1 times [2025-02-06 18:01:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:24,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624803435] [2025-02-06 18:01:24,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:25,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:01:25,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:01:25,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:25,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:25,523 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-06 18:01:25,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624803435] [2025-02-06 18:01:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624803435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425743221] [2025-02-06 18:01:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:25,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:25,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:25,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:25,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:25,548 INFO L87 Difference]: Start difference. First operand has 719 states, 583 states have (on average 1.6157804459691252) internal successors, (942), 659 states have internal predecessors, (942), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:25,786 INFO L93 Difference]: Finished difference Result 1327 states and 1977 transitions. [2025-02-06 18:01:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:25,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 18:01:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:25,798 INFO L225 Difference]: With dead ends: 1327 [2025-02-06 18:01:25,799 INFO L226 Difference]: Without dead ends: 609 [2025-02-06 18:01:25,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:25,808 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 1 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:25,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1655 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-02-06 18:01:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2025-02-06 18:01:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 508 states have (on average 1.5433070866141732) internal successors, (784), 558 states have internal predecessors, (784), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 867 transitions. [2025-02-06 18:01:25,875 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 867 transitions. Word has length 4 [2025-02-06 18:01:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:25,876 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 867 transitions. [2025-02-06 18:01:25,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 867 transitions. [2025-02-06 18:01:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:01:25,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:25,877 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:01:25,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:01:25,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:25,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -627052418, now seen corresponding path program 1 times [2025-02-06 18:01:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202903928] [2025-02-06 18:01:25,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:26,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:01:26,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:01:26,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:26,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:26,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:26,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202903928] [2025-02-06 18:01:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202903928] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:26,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658284171] [2025-02-06 18:01:26,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:26,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:26,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:26,360 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-06 18:01:26,362 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-06 18:01:26,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:01:26,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:01:26,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:26,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:26,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:26,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:26,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658284171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:26,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:26,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:01:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003364444] [2025-02-06 18:01:26,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:26,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:01:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:26,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:01:26,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:26,975 INFO L87 Difference]: Start difference. First operand 609 states and 867 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:27,085 INFO L93 Difference]: Finished difference Result 609 states and 867 transitions. [2025-02-06 18:01:27,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:01:27,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:01:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:27,089 INFO L225 Difference]: With dead ends: 609 [2025-02-06 18:01:27,089 INFO L226 Difference]: Without dead ends: 608 [2025-02-06 18:01:27,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:27,091 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 1 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:27,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1645 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-02-06 18:01:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2025-02-06 18:01:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 508 states have (on average 1.5413385826771653) internal successors, (783), 557 states have internal predecessors, (783), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 866 transitions. [2025-02-06 18:01:27,127 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 866 transitions. Word has length 7 [2025-02-06 18:01:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:27,127 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 866 transitions. [2025-02-06 18:01:27,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 866 transitions. [2025-02-06 18:01:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:01:27,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:27,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:01:27,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:01:27,328 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-06 18:01:27,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:27,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2036212673, now seen corresponding path program 1 times [2025-02-06 18:01:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:27,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764018272] [2025-02-06 18:01:27,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:27,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:01:27,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:01:27,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:27,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:01:27,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:27,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764018272] [2025-02-06 18:01:27,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764018272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:27,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:27,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:27,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899441774] [2025-02-06 18:01:27,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:27,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:27,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:27,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:27,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:27,703 INFO L87 Difference]: Start difference. First operand 608 states and 866 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:27,802 INFO L93 Difference]: Finished difference Result 608 states and 866 transitions. [2025-02-06 18:01:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:27,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 18:01:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:27,806 INFO L225 Difference]: With dead ends: 608 [2025-02-06 18:01:27,807 INFO L226 Difference]: Without dead ends: 607 [2025-02-06 18:01:27,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:27,808 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 0 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:27,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1646 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-06 18:01:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 605. [2025-02-06 18:01:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 506 states have (on average 1.541501976284585) internal successors, (780), 554 states have internal predecessors, (780), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 863 transitions. [2025-02-06 18:01:27,825 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 863 transitions. Word has length 8 [2025-02-06 18:01:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:27,826 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 863 transitions. [2025-02-06 18:01:27,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 863 transitions. [2025-02-06 18:01:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 18:01:27,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:27,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:01:27,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:27,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash 257183263, now seen corresponding path program 1 times [2025-02-06 18:01:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115538468] [2025-02-06 18:01:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:28,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:01:28,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:01:28,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:28,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115538468] [2025-02-06 18:01:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115538468] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086441324] [2025-02-06 18:01:28,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:28,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:28,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:28,313 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-06 18:01:28,316 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-06 18:01:28,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:01:28,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:01:28,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:28,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:28,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:01:28,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:01:28,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:28,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086441324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:28,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 18:01:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216492718] [2025-02-06 18:01:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:28,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:28,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:28,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:28,907 INFO L87 Difference]: Start difference. First operand 605 states and 863 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:28,995 INFO L93 Difference]: Finished difference Result 605 states and 863 transitions. [2025-02-06 18:01:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:28,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 18:01:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:28,999 INFO L225 Difference]: With dead ends: 605 [2025-02-06 18:01:28,999 INFO L226 Difference]: Without dead ends: 603 [2025-02-06 18:01:29,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:29,001 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 530 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:29,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1120 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-02-06 18:01:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2025-02-06 18:01:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 506 states have (on average 1.5375494071146245) internal successors, (778), 552 states have internal predecessors, (778), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 861 transitions. [2025-02-06 18:01:29,029 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 861 transitions. Word has length 12 [2025-02-06 18:01:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:29,030 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 861 transitions. [2025-02-06 18:01:29,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 861 transitions. [2025-02-06 18:01:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 18:01:29,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:29,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:29,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:01:29,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:29,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:29,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash -617252294, now seen corresponding path program 1 times [2025-02-06 18:01:29,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:29,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455378612] [2025-02-06 18:01:29,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:29,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:01:29,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:01:29,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:29,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:29,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:29,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455378612] [2025-02-06 18:01:29,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455378612] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:29,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259267367] [2025-02-06 18:01:29,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:29,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:29,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:29,534 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-06 18:01:29,559 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-06 18:01:29,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:01:30,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:01:30,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:30,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:30,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:30,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:30,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:30,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259267367] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:30,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:30,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:01:30,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710680461] [2025-02-06 18:01:30,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:30,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:01:30,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:30,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:01:30,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:30,064 INFO L87 Difference]: Start difference. First operand 603 states and 861 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:30,179 INFO L93 Difference]: Finished difference Result 1209 states and 1727 transitions. [2025-02-06 18:01:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:30,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-02-06 18:01:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:30,185 INFO L225 Difference]: With dead ends: 1209 [2025-02-06 18:01:30,185 INFO L226 Difference]: Without dead ends: 612 [2025-02-06 18:01:30,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:30,188 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 4 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2462 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:30,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2462 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:30,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-02-06 18:01:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2025-02-06 18:01:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 515 states have (on average 1.5281553398058252) internal successors, (787), 561 states have internal predecessors, (787), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 870 transitions. [2025-02-06 18:01:30,205 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 870 transitions. Word has length 13 [2025-02-06 18:01:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:30,205 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 870 transitions. [2025-02-06 18:01:30,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 870 transitions. [2025-02-06 18:01:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:01:30,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:30,205 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:30,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:01:30,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:30,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:30,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:30,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1117112197, now seen corresponding path program 2 times [2025-02-06 18:01:30,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:30,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44804502] [2025-02-06 18:01:30,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:01:30,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:30,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 18:01:30,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 18:01:30,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:01:30,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:30,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44804502] [2025-02-06 18:01:30,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44804502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:30,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:30,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:01:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029815644] [2025-02-06 18:01:30,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:30,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:01:30,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:30,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:01:30,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:30,875 INFO L87 Difference]: Start difference. First operand 612 states and 870 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:31,061 INFO L93 Difference]: Finished difference Result 612 states and 870 transitions. [2025-02-06 18:01:31,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:01:31,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 18:01:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:31,064 INFO L225 Difference]: With dead ends: 612 [2025-02-06 18:01:31,064 INFO L226 Difference]: Without dead ends: 610 [2025-02-06 18:01:31,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:31,065 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 529 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:31,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2687 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:01:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-02-06 18:01:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2025-02-06 18:01:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 515 states have (on average 1.5242718446601942) internal successors, (785), 559 states have internal predecessors, (785), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 868 transitions. [2025-02-06 18:01:31,085 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 868 transitions. Word has length 22 [2025-02-06 18:01:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:31,085 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 868 transitions. [2025-02-06 18:01:31,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 868 transitions. [2025-02-06 18:01:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 18:01:31,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:31,088 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:31,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:01:31,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:31,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1222656359, now seen corresponding path program 1 times [2025-02-06 18:01:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:31,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505996307] [2025-02-06 18:01:31,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:31,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 18:01:31,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 18:01:31,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:31,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:31,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:31,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505996307] [2025-02-06 18:01:31,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505996307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:31,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:31,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:31,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025614645] [2025-02-06 18:01:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:31,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:31,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:31,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:31,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:31,429 INFO L87 Difference]: Start difference. First operand 610 states and 868 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:31,518 INFO L93 Difference]: Finished difference Result 1203 states and 1720 transitions. [2025-02-06 18:01:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:31,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-06 18:01:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:31,522 INFO L225 Difference]: With dead ends: 1203 [2025-02-06 18:01:31,522 INFO L226 Difference]: Without dead ends: 613 [2025-02-06 18:01:31,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:31,525 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 1 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:31,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1635 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-02-06 18:01:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2025-02-06 18:01:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 518 states have (on average 1.5212355212355213) internal successors, (788), 562 states have internal predecessors, (788), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 871 transitions. [2025-02-06 18:01:31,547 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 871 transitions. Word has length 27 [2025-02-06 18:01:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:31,548 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 871 transitions. [2025-02-06 18:01:31,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 871 transitions. [2025-02-06 18:01:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 18:01:31,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:31,549 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:31,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:01:31,549 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:31,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:31,550 INFO L85 PathProgramCache]: Analyzing trace with hash 752020053, now seen corresponding path program 1 times [2025-02-06 18:01:31,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:31,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204203049] [2025-02-06 18:01:31,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:31,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:31,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 18:01:31,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 18:01:31,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:31,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:31,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204203049] [2025-02-06 18:01:31,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204203049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:31,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:31,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:31,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040092262] [2025-02-06 18:01:31,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:31,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:31,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:31,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:31,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:31,833 INFO L87 Difference]: Start difference. First operand 613 states and 871 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:31,938 INFO L93 Difference]: Finished difference Result 912 states and 1311 transitions. [2025-02-06 18:01:31,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:31,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-02-06 18:01:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:31,944 INFO L225 Difference]: With dead ends: 912 [2025-02-06 18:01:31,944 INFO L226 Difference]: Without dead ends: 910 [2025-02-06 18:01:31,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:31,945 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 412 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:31,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1622 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-02-06 18:01:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 617. [2025-02-06 18:01:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 522 states have (on average 1.5191570881226053) internal successors, (793), 566 states have internal predecessors, (793), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 876 transitions. [2025-02-06 18:01:31,968 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 876 transitions. Word has length 28 [2025-02-06 18:01:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:31,969 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 876 transitions. [2025-02-06 18:01:31,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 876 transitions. [2025-02-06 18:01:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:01:31,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:31,969 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:31,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:01:31,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:31,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1463173588, now seen corresponding path program 1 times [2025-02-06 18:01:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467859398] [2025-02-06 18:01:31,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:32,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:01:32,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:01:32,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:32,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:32,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:32,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467859398] [2025-02-06 18:01:32,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467859398] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:32,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243885531] [2025-02-06 18:01:32,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:32,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:32,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:32,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:32,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:01:32,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:01:32,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:01:32,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:32,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:32,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1938 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:01:32,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:01:32,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:01:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243885531] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:32,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:32,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:01:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686319255] [2025-02-06 18:01:32,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:32,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:01:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:32,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:01:32,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:01:32,908 INFO L87 Difference]: Start difference. First operand 617 states and 876 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 18:01:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:33,161 INFO L93 Difference]: Finished difference Result 1236 states and 1760 transitions. [2025-02-06 18:01:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:01:33,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-02-06 18:01:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:33,166 INFO L225 Difference]: With dead ends: 1236 [2025-02-06 18:01:33,167 INFO L226 Difference]: Without dead ends: 634 [2025-02-06 18:01:33,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:01:33,169 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 5 mSDsluCounter, 4872 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5686 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:33,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5686 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:01:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-06 18:01:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2025-02-06 18:01:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 540 states have (on average 1.5) internal successors, (810), 583 states have internal predecessors, (810), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 893 transitions. [2025-02-06 18:01:33,188 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 893 transitions. Word has length 30 [2025-02-06 18:01:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:33,189 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 893 transitions. [2025-02-06 18:01:33,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 18:01:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 893 transitions. [2025-02-06 18:01:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 18:01:33,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:33,191 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:33,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:01:33,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 18:01:33,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:33,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1402481684, now seen corresponding path program 1 times [2025-02-06 18:01:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428182392] [2025-02-06 18:01:33,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:33,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 18:01:33,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 18:01:33,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:33,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 18:01:33,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:33,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428182392] [2025-02-06 18:01:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428182392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:33,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307359928] [2025-02-06 18:01:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:33,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:33,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:33,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:33,672 INFO L87 Difference]: Start difference. First operand 634 states and 893 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:33,739 INFO L93 Difference]: Finished difference Result 646 states and 907 transitions. [2025-02-06 18:01:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:33,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-06 18:01:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:33,742 INFO L225 Difference]: With dead ends: 646 [2025-02-06 18:01:33,742 INFO L226 Difference]: Without dead ends: 644 [2025-02-06 18:01:33,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:33,744 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 2 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:33,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1630 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-06 18:01:33,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 643. [2025-02-06 18:01:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 549 states have (on average 1.4972677595628416) internal successors, (822), 592 states have internal predecessors, (822), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 905 transitions. [2025-02-06 18:01:33,758 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 905 transitions. Word has length 48 [2025-02-06 18:01:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:33,759 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 905 transitions. [2025-02-06 18:01:33,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 905 transitions. [2025-02-06 18:01:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:01:33,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:33,762 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:33,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:01:33,762 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:33,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash 527265339, now seen corresponding path program 1 times [2025-02-06 18:01:33,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:33,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58820215] [2025-02-06 18:01:33,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:33,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:01:33,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:01:33,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:33,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 18:01:33,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58820215] [2025-02-06 18:01:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58820215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:33,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:33,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:33,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460049175] [2025-02-06 18:01:33,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:33,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:33,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:33,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:33,986 INFO L87 Difference]: Start difference. First operand 643 states and 905 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:34,077 INFO L93 Difference]: Finished difference Result 643 states and 905 transitions. [2025-02-06 18:01:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:34,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-06 18:01:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:34,080 INFO L225 Difference]: With dead ends: 643 [2025-02-06 18:01:34,080 INFO L226 Difference]: Without dead ends: 642 [2025-02-06 18:01:34,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:34,081 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 0 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:34,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1633 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-02-06 18:01:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 638. [2025-02-06 18:01:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 545 states have (on average 1.4972477064220184) internal successors, (816), 587 states have internal predecessors, (816), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 899 transitions. [2025-02-06 18:01:34,097 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 899 transitions. Word has length 49 [2025-02-06 18:01:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:34,098 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 899 transitions. [2025-02-06 18:01:34,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 899 transitions. [2025-02-06 18:01:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 18:01:34,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:34,100 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:34,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:01:34,100 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:34,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash -946007559, now seen corresponding path program 1 times [2025-02-06 18:01:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089115881] [2025-02-06 18:01:34,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:34,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:01:34,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:01:34,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:34,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089115881] [2025-02-06 18:01:34,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089115881] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:34,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017523950] [2025-02-06 18:01:34,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:34,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:34,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:01:34,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:01:34,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:01:34,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:34,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:34,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:34,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:34,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:34,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017523950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:34,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:34,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:01:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124022711] [2025-02-06 18:01:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:34,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:01:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:34,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:01:34,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:34,917 INFO L87 Difference]: Start difference. First operand 638 states and 899 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:35,058 INFO L93 Difference]: Finished difference Result 935 states and 1338 transitions. [2025-02-06 18:01:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:01:35,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-06 18:01:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:35,062 INFO L225 Difference]: With dead ends: 935 [2025-02-06 18:01:35,062 INFO L226 Difference]: Without dead ends: 934 [2025-02-06 18:01:35,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:35,062 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 823 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:35,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 2451 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-06 18:01:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 637. [2025-02-06 18:01:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 545 states have (on average 1.4954128440366972) internal successors, (815), 586 states have internal predecessors, (815), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 898 transitions. [2025-02-06 18:01:35,079 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 898 transitions. Word has length 50 [2025-02-06 18:01:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:35,079 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 898 transitions. [2025-02-06 18:01:35,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 898 transitions. [2025-02-06 18:01:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 18:01:35,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:35,080 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:35,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 18:01:35,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 18:01:35,281 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:35,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash 738537864, now seen corresponding path program 1 times [2025-02-06 18:01:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441709157] [2025-02-06 18:01:35,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:35,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:01:35,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:01:35,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:35,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441709157] [2025-02-06 18:01:35,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441709157] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49128446] [2025-02-06 18:01:35,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:35,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:35,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:35,530 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:35,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:01:35,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:01:36,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:01:36,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:36,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:36,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 2059 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:36,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:36,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:36,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49128446] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:36,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 18:01:36,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904987495] [2025-02-06 18:01:36,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:36,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:01:36,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:36,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:01:36,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:36,163 INFO L87 Difference]: Start difference. First operand 637 states and 898 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:36,511 INFO L93 Difference]: Finished difference Result 1822 states and 2648 transitions. [2025-02-06 18:01:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:36,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-02-06 18:01:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:36,520 INFO L225 Difference]: With dead ends: 1822 [2025-02-06 18:01:36,520 INFO L226 Difference]: Without dead ends: 1821 [2025-02-06 18:01:36,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:36,522 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 1644 mSDsluCounter, 5188 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 6000 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:36,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 6000 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:01:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2025-02-06 18:01:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 649. [2025-02-06 18:01:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 557 states have (on average 1.4901256732495511) internal successors, (830), 598 states have internal predecessors, (830), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 913 transitions. [2025-02-06 18:01:36,555 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 913 transitions. Word has length 51 [2025-02-06 18:01:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:36,556 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 913 transitions. [2025-02-06 18:01:36,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 913 transitions. [2025-02-06 18:01:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 18:01:36,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:36,558 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:36,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:01:36,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 18:01:36,759 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:36,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash 487892401, now seen corresponding path program 1 times [2025-02-06 18:01:36,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:36,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953512325] [2025-02-06 18:01:36,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:36,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:36,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:01:36,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:01:36,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:36,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953512325] [2025-02-06 18:01:37,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953512325] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849119878] [2025-02-06 18:01:37,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:37,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:37,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:37,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:37,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:01:37,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:01:37,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:01:37,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:37,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:37,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:37,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:37,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:37,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849119878] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:37,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:37,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:01:37,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713877519] [2025-02-06 18:01:37,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:37,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:01:37,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:37,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:01:37,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:37,655 INFO L87 Difference]: Start difference. First operand 649 states and 913 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:37,753 INFO L93 Difference]: Finished difference Result 1273 states and 1803 transitions. [2025-02-06 18:01:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:37,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-06 18:01:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:37,756 INFO L225 Difference]: With dead ends: 1273 [2025-02-06 18:01:37,756 INFO L226 Difference]: Without dead ends: 667 [2025-02-06 18:01:37,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:37,758 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 4 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:37,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2445 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-02-06 18:01:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-02-06 18:01:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 575 states have (on average 1.4747826086956521) internal successors, (848), 616 states have internal predecessors, (848), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 18:01:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 931 transitions. [2025-02-06 18:01:37,775 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 931 transitions. Word has length 55 [2025-02-06 18:01:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:37,775 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 931 transitions. [2025-02-06 18:01:37,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 931 transitions. [2025-02-06 18:01:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 18:01:37,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:37,776 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 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-06 18:01:37,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 18:01:37,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:37,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:37,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:37,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1490576747, now seen corresponding path program 1 times [2025-02-06 18:01:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:37,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944778864] [2025-02-06 18:01:37,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:37,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:38,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 18:01:38,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 18:01:38,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:38,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:38,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:38,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944778864] [2025-02-06 18:01:38,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944778864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:38,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:38,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543388880] [2025-02-06 18:01:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:38,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:38,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:38,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:38,231 INFO L87 Difference]: Start difference. First operand 667 states and 931 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:01:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:38,359 INFO L93 Difference]: Finished difference Result 1330 states and 1889 transitions. [2025-02-06 18:01:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-02-06 18:01:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:38,362 INFO L225 Difference]: With dead ends: 1330 [2025-02-06 18:01:38,362 INFO L226 Difference]: Without dead ends: 763 [2025-02-06 18:01:38,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:38,363 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 120 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:38,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1580 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-02-06 18:01:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 709. [2025-02-06 18:01:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 616 states have (on average 1.4675324675324675) internal successors, (904), 657 states have internal predecessors, (904), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 989 transitions. [2025-02-06 18:01:38,381 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 989 transitions. Word has length 60 [2025-02-06 18:01:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:38,381 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 989 transitions. [2025-02-06 18:01:38,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:01:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 989 transitions. [2025-02-06 18:01:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 18:01:38,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:38,382 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:01:38,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:01:38,382 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:38,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:38,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2074787895, now seen corresponding path program 1 times [2025-02-06 18:01:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:38,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278691157] [2025-02-06 18:01:38,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:38,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:38,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 18:01:38,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 18:01:38,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:38,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278691157] [2025-02-06 18:01:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278691157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:38,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122414541] [2025-02-06 18:01:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:38,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:38,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:38,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:38,626 INFO L87 Difference]: Start difference. First operand 709 states and 989 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:38,698 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2025-02-06 18:01:38,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:38,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2025-02-06 18:01:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:38,702 INFO L225 Difference]: With dead ends: 711 [2025-02-06 18:01:38,703 INFO L226 Difference]: Without dead ends: 709 [2025-02-06 18:01:38,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:38,704 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 1 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:38,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1631 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-02-06 18:01:38,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2025-02-06 18:01:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 616 states have (on average 1.4642857142857142) internal successors, (902), 657 states have internal predecessors, (902), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 987 transitions. [2025-02-06 18:01:38,722 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 987 transitions. Word has length 62 [2025-02-06 18:01:38,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:38,722 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 987 transitions. [2025-02-06 18:01:38,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 987 transitions. [2025-02-06 18:01:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 18:01:38,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:38,723 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:38,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:01:38,723 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:38,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1469024068, now seen corresponding path program 2 times [2025-02-06 18:01:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:38,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970104884] [2025-02-06 18:01:38,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:01:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:38,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-06 18:01:38,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-02-06 18:01:38,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:01:38,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-06 18:01:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970104884] [2025-02-06 18:01:39,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970104884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:39,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:39,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:01:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017385057] [2025-02-06 18:01:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:39,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:01:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:39,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:01:39,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:39,088 INFO L87 Difference]: Start difference. First operand 709 states and 987 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:39,279 INFO L93 Difference]: Finished difference Result 1346 states and 1896 transitions. [2025-02-06 18:01:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:39,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-02-06 18:01:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:39,282 INFO L225 Difference]: With dead ends: 1346 [2025-02-06 18:01:39,282 INFO L226 Difference]: Without dead ends: 709 [2025-02-06 18:01:39,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:39,283 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 536 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:39,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 3158 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:01:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-02-06 18:01:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2025-02-06 18:01:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 616 states have (on average 1.4626623376623376) internal successors, (901), 657 states have internal predecessors, (901), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 986 transitions. [2025-02-06 18:01:39,300 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 986 transitions. Word has length 63 [2025-02-06 18:01:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:39,300 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 986 transitions. [2025-02-06 18:01:39,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 986 transitions. [2025-02-06 18:01:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 18:01:39,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:39,301 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:39,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:01:39,301 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:39,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1379690401, now seen corresponding path program 2 times [2025-02-06 18:01:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:39,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104440749] [2025-02-06 18:01:39,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:01:39,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:39,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 18:01:39,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 18:01:39,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:01:39,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-06 18:01:39,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:39,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104440749] [2025-02-06 18:01:39,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104440749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:39,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631417047] [2025-02-06 18:01:39,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:01:39,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:39,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:39,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:39,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 18:01:40,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 18:01:50,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 18:01:50,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:01:50,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:50,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 2245 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:01:50,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 18:01:50,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 18:01:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631417047] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:50,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:50,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:01:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757771009] [2025-02-06 18:01:50,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:50,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:01:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:50,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:01:50,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:01:50,601 INFO L87 Difference]: Start difference. First operand 709 states and 986 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:51,049 INFO L93 Difference]: Finished difference Result 1401 states and 1965 transitions. [2025-02-06 18:01:51,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 18:01:51,049 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-02-06 18:01:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:51,053 INFO L225 Difference]: With dead ends: 1401 [2025-02-06 18:01:51,053 INFO L226 Difference]: Without dead ends: 744 [2025-02-06 18:01:51,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 18:01:51,056 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 9 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3239 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:51,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3239 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:01:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-02-06 18:01:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2025-02-06 18:01:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 652 states have (on average 1.4355828220858895) internal successors, (936), 692 states have internal predecessors, (936), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1021 transitions. [2025-02-06 18:01:51,083 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1021 transitions. Word has length 73 [2025-02-06 18:01:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:51,083 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1021 transitions. [2025-02-06 18:01:51,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1021 transitions. [2025-02-06 18:01:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 18:01:51,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:51,086 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:51,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 18:01:51,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 18:01:51,287 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:51,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash -561078940, now seen corresponding path program 1 times [2025-02-06 18:01:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906961549] [2025-02-06 18:01:51,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:51,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 18:01:51,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 18:01:51,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:51,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906961549] [2025-02-06 18:01:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906961549] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583211675] [2025-02-06 18:01:51,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:51,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:51,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:51,718 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:51,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 18:01:52,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 18:01:52,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 18:01:52,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:52,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:52,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 2366 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:01:52,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:52,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:52,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583211675] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:52,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:52,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 18:01:52,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20817663] [2025-02-06 18:01:52,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:52,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:01:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:52,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:01:52,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:01:52,518 INFO L87 Difference]: Start difference. First operand 744 states and 1021 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:53,116 INFO L93 Difference]: Finished difference Result 4119 states and 5947 transitions. [2025-02-06 18:01:53,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:01:53,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-02-06 18:01:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:53,129 INFO L225 Difference]: With dead ends: 4119 [2025-02-06 18:01:53,130 INFO L226 Difference]: Without dead ends: 4118 [2025-02-06 18:01:53,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:01:53,131 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 5850 mSDsluCounter, 8004 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5930 SdHoareTripleChecker+Valid, 8815 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:53,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5930 Valid, 8815 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:01:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2025-02-06 18:01:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 768. [2025-02-06 18:01:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 676 states have (on average 1.4289940828402368) internal successors, (966), 716 states have internal predecessors, (966), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1051 transitions. [2025-02-06 18:01:53,167 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1051 transitions. Word has length 97 [2025-02-06 18:01:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:53,167 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1051 transitions. [2025-02-06 18:01:53,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1051 transitions. [2025-02-06 18:01:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:01:53,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:53,168 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:01:53,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 18:01:53,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:53,369 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:53,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash -524679482, now seen corresponding path program 1 times [2025-02-06 18:01:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:53,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895413778] [2025-02-06 18:01:53,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:53,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:01:53,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:01:53,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:53,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:53,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:53,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895413778] [2025-02-06 18:01:53,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895413778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:53,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:53,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:53,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441575542] [2025-02-06 18:01:53,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:53,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:53,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:53,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:53,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:53,610 INFO L87 Difference]: Start difference. First operand 768 states and 1051 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:53,732 INFO L93 Difference]: Finished difference Result 1332 states and 1880 transitions. [2025-02-06 18:01:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-06 18:01:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:53,735 INFO L225 Difference]: With dead ends: 1332 [2025-02-06 18:01:53,735 INFO L226 Difference]: Without dead ends: 821 [2025-02-06 18:01:53,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:53,736 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 75 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:53,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1613 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-02-06 18:01:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 771. [2025-02-06 18:01:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 681 states have (on average 1.4243759177679882) internal successors, (970), 719 states have internal predecessors, (970), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1055 transitions. [2025-02-06 18:01:53,753 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1055 transitions. Word has length 103 [2025-02-06 18:01:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:53,753 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1055 transitions. [2025-02-06 18:01:53,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1055 transitions. [2025-02-06 18:01:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:01:53,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:53,754 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:01:53,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:01:53,754 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:53,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash -520402807, now seen corresponding path program 1 times [2025-02-06 18:01:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644387048] [2025-02-06 18:01:53,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:53,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:01:54,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:01:54,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:54,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:54,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:54,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644387048] [2025-02-06 18:01:54,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644387048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:54,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:54,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:54,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097542434] [2025-02-06 18:01:54,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:54,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:54,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:54,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:54,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:54,204 INFO L87 Difference]: Start difference. First operand 771 states and 1055 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:54,329 INFO L93 Difference]: Finished difference Result 825 states and 1135 transitions. [2025-02-06 18:01:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:54,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-06 18:01:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:54,332 INFO L225 Difference]: With dead ends: 825 [2025-02-06 18:01:54,332 INFO L226 Difference]: Without dead ends: 822 [2025-02-06 18:01:54,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:54,333 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 189 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:54,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1427 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-06 18:01:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 768. [2025-02-06 18:01:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 681 states have (on average 1.4199706314243759) internal successors, (967), 716 states have internal predecessors, (967), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1052 transitions. [2025-02-06 18:01:54,371 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1052 transitions. Word has length 103 [2025-02-06 18:01:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:54,371 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1052 transitions. [2025-02-06 18:01:54,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1052 transitions. [2025-02-06 18:01:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:01:54,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:54,373 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:01:54,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 18:01:54,373 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:54,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash 914806100, now seen corresponding path program 1 times [2025-02-06 18:01:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:54,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080503429] [2025-02-06 18:01:54,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:54,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:54,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:01:54,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:01:54,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:54,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080503429] [2025-02-06 18:01:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080503429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:54,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:54,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:54,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881187942] [2025-02-06 18:01:54,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:54,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:54,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:54,634 INFO L87 Difference]: Start difference. First operand 768 states and 1052 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:54,751 INFO L93 Difference]: Finished difference Result 1334 states and 1882 transitions. [2025-02-06 18:01:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 18:01:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:54,754 INFO L225 Difference]: With dead ends: 1334 [2025-02-06 18:01:54,754 INFO L226 Difference]: Without dead ends: 819 [2025-02-06 18:01:54,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:54,757 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 157 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:54,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1503 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-02-06 18:01:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 753. [2025-02-06 18:01:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 670 states have (on average 1.4134328358208956) internal successors, (947), 701 states have internal predecessors, (947), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1032 transitions. [2025-02-06 18:01:54,775 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1032 transitions. Word has length 104 [2025-02-06 18:01:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:54,775 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1032 transitions. [2025-02-06 18:01:54,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1032 transitions. [2025-02-06 18:01:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:01:54,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:54,776 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:01:54,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 18:01:54,776 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:54,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1047383064, now seen corresponding path program 1 times [2025-02-06 18:01:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:54,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808607548] [2025-02-06 18:01:54,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:54,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:01:54,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:01:54,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:54,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:55,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808607548] [2025-02-06 18:01:55,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808607548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:55,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573888795] [2025-02-06 18:01:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:55,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:55,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:55,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:55,057 INFO L87 Difference]: Start difference. First operand 753 states and 1032 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:55,160 INFO L93 Difference]: Finished difference Result 807 states and 1112 transitions. [2025-02-06 18:01:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:55,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 18:01:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:55,163 INFO L225 Difference]: With dead ends: 807 [2025-02-06 18:01:55,163 INFO L226 Difference]: Without dead ends: 806 [2025-02-06 18:01:55,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:55,164 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 187 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:55,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1459 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-06 18:01:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 752. [2025-02-06 18:01:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 670 states have (on average 1.4119402985074627) internal successors, (946), 700 states have internal predecessors, (946), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1031 transitions. [2025-02-06 18:01:55,181 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1031 transitions. Word has length 104 [2025-02-06 18:01:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:55,181 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1031 transitions. [2025-02-06 18:01:55,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1031 transitions. [2025-02-06 18:01:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 18:01:55,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:55,182 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:55,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:01:55,182 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:55,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash 668617299, now seen corresponding path program 1 times [2025-02-06 18:01:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:55,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071165978] [2025-02-06 18:01:55,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:55,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:01:55,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:01:55,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:55,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071165978] [2025-02-06 18:01:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071165978] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:55,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307093459] [2025-02-06 18:01:55,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:55,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:55,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:55,583 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:55,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 18:01:56,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:01:56,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:01:56,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:56,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:56,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 2454 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:01:56,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:01:56,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:56,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307093459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:56,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 18:01:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730732521] [2025-02-06 18:01:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:56,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:01:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:56,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:01:56,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:56,311 INFO L87 Difference]: Start difference. First operand 752 states and 1031 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:01:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:56,490 INFO L93 Difference]: Finished difference Result 1434 states and 2019 transitions. [2025-02-06 18:01:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:01:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-02-06 18:01:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:56,494 INFO L225 Difference]: With dead ends: 1434 [2025-02-06 18:01:56,494 INFO L226 Difference]: Without dead ends: 869 [2025-02-06 18:01:56,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:56,495 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 286 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 3086 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:56,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 3086 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:01:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-02-06 18:01:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 751. [2025-02-06 18:01:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 671 states have (on average 1.405365126676602) internal successors, (943), 699 states have internal predecessors, (943), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1028 transitions. [2025-02-06 18:01:56,512 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1028 transitions. Word has length 105 [2025-02-06 18:01:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:56,512 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1028 transitions. [2025-02-06 18:01:56,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:01:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1028 transitions. [2025-02-06 18:01:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 18:01:56,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:56,514 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:56,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 18:01:56,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 18:01:56,718 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:56,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:56,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1279266123, now seen corresponding path program 1 times [2025-02-06 18:01:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:56,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499208436] [2025-02-06 18:01:56,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:56,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 18:01:56,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 18:01:56,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:56,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-02-06 18:01:57,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:57,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499208436] [2025-02-06 18:01:57,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499208436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:57,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:57,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:57,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917347246] [2025-02-06 18:01:57,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:57,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:57,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:57,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:57,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:57,035 INFO L87 Difference]: Start difference. First operand 751 states and 1028 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:57,102 INFO L93 Difference]: Finished difference Result 751 states and 1028 transitions. [2025-02-06 18:01:57,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:57,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-02-06 18:01:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:57,105 INFO L225 Difference]: With dead ends: 751 [2025-02-06 18:01:57,105 INFO L226 Difference]: Without dead ends: 750 [2025-02-06 18:01:57,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:57,106 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 1 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:57,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1605 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-02-06 18:01:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2025-02-06 18:01:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 671 states have (on average 1.4038748137108792) internal successors, (942), 698 states have internal predecessors, (942), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 18:01:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1027 transitions. [2025-02-06 18:01:57,150 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1027 transitions. Word has length 108 [2025-02-06 18:01:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:57,150 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1027 transitions. [2025-02-06 18:01:57,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1027 transitions. [2025-02-06 18:01:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 18:01:57,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:57,151 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:57,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 18:01:57,152 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:01:57,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:57,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1002543056, now seen corresponding path program 1 times [2025-02-06 18:01:57,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:57,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555193368] [2025-02-06 18:01:57,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:57,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:57,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 18:01:57,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 18:01:57,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:57,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-06 18:02:02,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:02,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555193368] [2025-02-06 18:02:02,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555193368] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:02:02,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133431797] [2025-02-06 18:02:02,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:02,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:02,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:02,760 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:02,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 18:02:03,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 18:02:03,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 18:02:03,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:03,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:03,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:02:03,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:02:03,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133431797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:03,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:02:03,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2025-02-06 18:02:03,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629490619] [2025-02-06 18:02:03,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:03,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:02:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:02:03,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:02:03,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-06 18:02:03,816 INFO L87 Difference]: Start difference. First operand 750 states and 1027 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:02:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:03,909 INFO L93 Difference]: Finished difference Result 1349 states and 1890 transitions. [2025-02-06 18:02:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:02:03,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-02-06 18:02:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:03,917 INFO L225 Difference]: With dead ends: 1349 [2025-02-06 18:02:03,918 INFO L226 Difference]: Without dead ends: 753 [2025-02-06 18:02:03,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-06 18:02:03,920 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 0 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:03,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2402 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:02:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-02-06 18:02:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2025-02-06 18:02:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 673 states have (on average 1.4041604754829122) internal successors, (945), 701 states have internal predecessors, (945), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-02-06 18:02:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1033 transitions. [2025-02-06 18:02:03,947 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1033 transitions. Word has length 109 [2025-02-06 18:02:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:03,947 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1033 transitions. [2025-02-06 18:02:03,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:02:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1033 transitions. [2025-02-06 18:02:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 18:02:03,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:03,949 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:03,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 18:02:04,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 18:02:04,149 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-06 18:02:04,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash -463625911, now seen corresponding path program 1 times [2025-02-06 18:02:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:02:04,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999841472] [2025-02-06 18:02:04,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:02:04,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:02:04,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:02:04,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:04,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-06 18:02:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:02:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999841472] [2025-02-06 18:02:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999841472] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:02:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448174461] [2025-02-06 18:02:09,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:09,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:09,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:09,983 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:09,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 18:02:10,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:02:10,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:02:10,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:10,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:10,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-02-06 18:02:10,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:10,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:10,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:10,956 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 18:02:10,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 18:02:10,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:11,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,635 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-06 18:02:11,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-06 18:02:11,751 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-02-06 18:02:11,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-02-06 18:02:11,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:11,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:11,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-02-06 18:02:11,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:11,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2025-02-06 18:02:11,902 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:11,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 109 [2025-02-06 18:02:11,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:11,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-02-06 18:02:11,939 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-06 18:02:11,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2025-02-06 18:02:11,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:11,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-02-06 18:02:11,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:02:11,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-02-06 18:02:12,063 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:12,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-02-06 18:02:12,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:02:12,142 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:12,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-02-06 18:02:12,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:02:12,226 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:12,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-02-06 18:02:12,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:02:12,310 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:12,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-02-06 18:02:12,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:02:12,394 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:12,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-02-06 18:02:12,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:02:12,490 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:12,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-02-06 18:02:12,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:02:12,560 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:12,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-02-06 18:02:12,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:02:12,629 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:12,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-02-06 18:02:12,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:02:12,699 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-06 18:02:12,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 98 [2025-02-06 18:02:12,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:02:12,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 24 [2025-02-06 18:02:12,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:02:12,901 WARN L873 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memset_#ptr.base| Int)) (= (store |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|)) |c_#memory_int|)) is different from true [2025-02-06 18:02:12,927 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-06 18:02:12,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2025-02-06 18:02:13,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:02:13,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2025-02-06 18:02:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 241 trivial. 1 not checked. [2025-02-06 18:02:13,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:02:13,507 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8134 (Array Int Int)) (v_ArrVal_8132 (Array Int Int)) (v_ArrVal_8133 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store |c_#memory_int| .cse0 v_ArrVal_8133) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8132) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8134))) 18) 0) 33))) is different from false [2025-02-06 18:02:13,635 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8134 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8128 (Array Int Int)) (v_ArrVal_8132 (Array Int Int)) (v_ArrVal_8133 (Array Int Int)) (v_ArrVal_8130 (Array Int Int)) (v_ArrVal_8131 (Array Int Int))) (not (= (select (select (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8128))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8130))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8129) .cse1 v_ArrVal_8131) .cse2 v_ArrVal_8133) (select (select (store .cse3 .cse2 v_ArrVal_8132) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_8134))))))) 18) 0) 33))) is different from false [2025-02-06 18:02:13,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8134 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int)) (v_ArrVal_8132 (Array Int Int)) (v_ArrVal_8133 (Array Int Int)) (v_ArrVal_8130 (Array Int Int)) (v_ArrVal_8131 (Array Int Int))) (not (= (select (select (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8127))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_8128))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_8130))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8126) .cse1 v_ArrVal_8129) .cse2 v_ArrVal_8131) .cse3 v_ArrVal_8133) (select (select (store .cse4 .cse3 v_ArrVal_8132) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_8134))))))))) 18) 0) 33))) is different from false [2025-02-06 18:02:13,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8134 (Array Int Int)) (v_ArrVal_8124 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int)) (v_ArrVal_8132 (Array Int Int)) (v_ArrVal_8133 (Array Int Int)) (v_ArrVal_8130 (Array Int Int)) (v_ArrVal_8131 (Array Int Int))) (not (= 33 (select (select (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8125))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_8127))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_8128))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_8130))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8124) .cse1 v_ArrVal_8126) .cse2 v_ArrVal_8129) .cse3 v_ArrVal_8131) .cse4 v_ArrVal_8133) (select (select (store .cse5 .cse4 v_ArrVal_8132) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_8134))))))))))) 18) 0)))) is different from false [2025-02-06 18:02:15,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8121 (Array Int Int)) (v_ArrVal_8132 (Array Int Int)) (v_ArrVal_8122 (Array Int Int)) (v_ArrVal_8133 (Array Int Int)) (v_ArrVal_8130 (Array Int Int)) (v_ArrVal_8120 (Array Int Int)) (v_ArrVal_8131 (Array Int Int)) (v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8123 (Array Int Int)) (v_ArrVal_8134 (Array Int Int)) (v_ArrVal_8124 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int))) (not (= (select (select (let ((.cse8 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8120))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_8123))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_8125))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_8127))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_8128))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_8130))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8121) .cse1 v_ArrVal_8122) .cse2 v_ArrVal_8124) .cse3 v_ArrVal_8126) .cse4 v_ArrVal_8129) .cse5 v_ArrVal_8131) .cse6 v_ArrVal_8133) (select (select (store .cse7 .cse6 v_ArrVal_8132) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_8134))))))))))))))) 18) 0) 33))) is different from false [2025-02-06 18:02:15,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8121 (Array Int Int)) (v_ArrVal_8132 (Array Int Int)) (v_ArrVal_8122 (Array Int Int)) (v_ArrVal_8133 (Array Int Int)) (v_ArrVal_8130 (Array Int Int)) (v_ArrVal_8120 (Array Int Int)) (v_ArrVal_8131 (Array Int Int)) (v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8123 (Array Int Int)) (v_ArrVal_8134 (Array Int Int)) (v_ArrVal_8124 (Array Int Int)) (v_ArrVal_8118 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8119 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int))) (not (= 33 (select (select (let ((.cse9 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8118))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_8120))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_8123))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_8125))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_8127))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_8128))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse8 (store .cse10 .cse6 v_ArrVal_8130))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8119) .cse1 v_ArrVal_8121) .cse2 v_ArrVal_8122) .cse3 v_ArrVal_8124) .cse4 v_ArrVal_8126) .cse5 v_ArrVal_8129) .cse6 v_ArrVal_8131) .cse7 v_ArrVal_8133) (select (select (store .cse8 .cse7 v_ArrVal_8132) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_8134))))))))))))))))) 18) 0)))) is different from false [2025-02-06 18:02:18,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8121 (Array Int Int)) (v_ArrVal_8132 (Array Int Int)) (v_ArrVal_8122 (Array Int Int)) (v_ArrVal_8133 (Array Int Int)) (v_ArrVal_8130 (Array Int Int)) (v_ArrVal_8120 (Array Int Int)) (v_ArrVal_8131 (Array Int Int)) (v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8123 (Array Int Int)) (v_ArrVal_8134 (Array Int Int)) (v_ArrVal_8124 (Array Int Int)) (v_ArrVal_8118 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8119 (Array Int Int)) (v_ArrVal_8116 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8117 (Array Int Int)) (v_ArrVal_8128 (Array Int Int))) (not (= (select (select (let ((.cse10 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8117))) (let ((.cse1 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse16 (store .cse17 .cse1 v_ArrVal_8118))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_8120))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_8123))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_8125))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_8127))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_8128))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse9 (store .cse11 .cse7 v_ArrVal_8130))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (store (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8116) .cse1 v_ArrVal_8119) .cse2 v_ArrVal_8121) .cse3 v_ArrVal_8122) .cse4 v_ArrVal_8124) .cse5 v_ArrVal_8126) .cse6 v_ArrVal_8129) .cse7 v_ArrVal_8131) .cse8 v_ArrVal_8133) (select (select (store .cse9 .cse8 v_ArrVal_8132) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_8134))))))))))))))))))) 18) 0) 33))) is different from false [2025-02-06 18:02:18,744 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-02-06 18:02:18,744 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51167 treesize of output 14364