./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/printf-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 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:27:44,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:27:44,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:27:44,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:27:44,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:27:44,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:27:44,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:27:44,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:27:44,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:27:44,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:27:44,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:27:44,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:27:44,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:27:44,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:27:44,658 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:27:44,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:27:44,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:27:44,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:27:44,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:27:44,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:27:44,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:27:44,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:27:44,659 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:27:44,659 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:27:44,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:27:44,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:27:44,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:27:44,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:27:44,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:27:44,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:27:44,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:27:44,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:27:44,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:27:44,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:27:44,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:27:44,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:27:44,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:27:44,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:27:44,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:27:44,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:27:44,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:27:44,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:27:44,661 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 -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-02-08 13:27:44,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:27:44,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:27:44,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:27:44,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:27:44,950 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:27:44,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-02-08 13:27:46,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4df15dd86/7d404f2ef093429ebfb2ce3c589ee0bf/FLAG83b3b9989 [2025-02-08 13:27:46,798 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:27:46,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-02-08 13:27:46,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4df15dd86/7d404f2ef093429ebfb2ce3c589ee0bf/FLAG83b3b9989 [2025-02-08 13:27:46,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4df15dd86/7d404f2ef093429ebfb2ce3c589ee0bf [2025-02-08 13:27:46,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:27:46,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:27:46,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:27:46,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:27:46,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:27:46,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:27:46" (1/1) ... [2025-02-08 13:27:46,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c22cc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:46, skipping insertion in model container [2025-02-08 13:27:46,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:27:46" (1/1) ... [2025-02-08 13:27:46,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:27:47,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:27:47,975 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:27:48,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:27:48,315 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:27:48,322 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:27:48,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48 WrapperNode [2025-02-08 13:27:48,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:27:48,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:27:48,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:27:48,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:27:48,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,466 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1861 [2025-02-08 13:27:48,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:27:48,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:27:48,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:27:48,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:27:48,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,503 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:27:48,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:27:48,629 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:27:48,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:27:48,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:27:48,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (1/1) ... [2025-02-08 13:27:48,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:27:48,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:48,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:27:48,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:27:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-08 13:27:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-02-08 13:27:48,685 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-02-08 13:27:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:27:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-08 13:27:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-02-08 13:27:48,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-02-08 13:27:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:27:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:27:48,685 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-02-08 13:27:48,686 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:27:48,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 13:27:48,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:27:48,686 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-02-08 13:27:48,686 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-02-08 13:27:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-02-08 13:27:48,686 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:27:48,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-02-08 13:27:48,687 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-02-08 13:27:48,687 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-02-08 13:27:48,687 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-02-08 13:27:48,687 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:27:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-02-08 13:27:48,687 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-02-08 13:27:49,192 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:27:49,194 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:27:49,307 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-02-08 13:27:49,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2682: SUMMARY for call reach_error(); srcloc: null [2025-02-08 13:27:49,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678: assume -9223372036854775808 <= conv_strtoull_#t~ret142#1 && conv_strtoull_#t~ret142#1 <= 9223372036854775807;conv_strtoull_~return_value_bb_strtoll$1~0#1 := conv_strtoull_#t~ret142#1;havoc conv_strtoull_#t~ret142#1; [2025-02-08 13:27:49,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678-1: SUMMARY for call conv_strtoull_#t~ret142#1 := bb_strtoll(conv_strtoull_~arg#1.base, conv_strtoull_~arg#1.offset, 0, 0, 0); srcloc: null [2025-02-08 13:27:49,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset;conv_strtoull_#t~ret140#1 := bb_strtoull_#res#1;havoc bb_strtoull_#t~mem103#1, bb_strtoull_#t~ret104#1, bb_strtoull_#t~ret105#1, bb_strtoull_#t~nondet106#1, bb_strtoull_#t~ret107#1, bb_strtoull_~arg#1.base, bb_strtoull_~arg#1.offset, bb_strtoull_~endp#1.base, bb_strtoull_~endp#1.offset, bb_strtoull_~base#1, bb_strtoull_~v~2#1, bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset, bb_strtoull_~return_value_bb_ascii_isalnum$2~0#1, bb_strtoull_~return_value_ret_ERANGE$1~0#1, bb_strtoull_~return_value_handle_errors$3~0#1;havoc bb_strtoull_#in~arg#1.base, bb_strtoull_#in~arg#1.offset, bb_strtoull_#in~endp#1.base, bb_strtoull_#in~endp#1.offset, bb_strtoull_#in~base#1;assume { :end_inline_bb_strtoull } true;call write~int(conv_strtoull_#t~ret140#1, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset, 8);havoc conv_strtoull_#t~ret140#1;call conv_strtoull_#t~mem141#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:27:49,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: havoc conv_strtoull_#t~ret140#1, conv_strtoull_#t~mem141#1, conv_strtoull_#t~ret142#1, conv_strtoull_~return_value_bb_strtoll$1~0#1, conv_strtoull_~arg#1.base, conv_strtoull_~arg#1.offset, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset;havoc conv_strtoull_#in~arg#1.base, conv_strtoull_#in~arg#1.offset, conv_strtoull_#in~result#1.base, conv_strtoull_#in~result#1.offset;assume { :end_inline_conv_strtoull } true; [2025-02-08 13:27:49,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2683: call write~int(conv_strtoull_~return_value_bb_strtoll$1~0#1, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset, 8);havoc conv_strtoull_~return_value_bb_strtoll$1~0#1; [2025-02-08 13:27:49,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3257: utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset := utoa_to_buf_#res#1.base, utoa_to_buf_#res#1.offset;havoc utoa_to_buf_~n#1, utoa_to_buf_~buf#1.base, utoa_to_buf_~buf#1.offset, utoa_to_buf_~buflen#1, utoa_to_buf_~i~0#1, utoa_to_buf_~out~0#1, utoa_to_buf_~res~0#1, utoa_to_buf_~tmp_post$1~1#1.base, utoa_to_buf_~tmp_post$1~1#1.offset;havoc utoa_to_buf_#in~n#1, utoa_to_buf_#in~buf#1.base, utoa_to_buf_#in~buf#1.offset, utoa_to_buf_#in~buflen#1;assume { :end_inline_utoa_to_buf } true;utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset := utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset;havoc utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset;call write~int(0, utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset, 1);utoa_#res#1.base, utoa_#res#1.offset := ~#local_buf~0.base, ~#local_buf~0.offset; [2025-02-08 13:27:49,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679: assume !(conv_strtoull_~result#1.base == 0 && conv_strtoull_~result#1.offset == 0); [2025-02-08 13:27:49,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679: assume !!(conv_strtoull_~result#1.base == 0 && conv_strtoull_~result#1.offset == 0); [2025-02-08 13:27:49,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: assume !(0 == conv_strtoull_#t~mem141#1);havoc conv_strtoull_#t~mem141#1;havoc conv_strtoull_~return_value_bb_strtoll$1~0#1; [2025-02-08 13:27:49,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: assume !!(0 == conv_strtoull_#t~mem141#1);havoc conv_strtoull_#t~mem141#1; [2025-02-08 13:27:49,608 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754: #t~ret156#1.base, #t~ret156#1.offset := utoa_#res#1.base, utoa_#res#1.offset;havoc utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset, utoa_~n#1, utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset;havoc utoa_#in~n#1;assume { :end_inline_utoa } true;~arg#1.base, ~arg#1.offset := #t~ret156#1.base, #t~ret156#1.offset;havoc #t~mem155#1;havoc #t~ret156#1.base, #t~ret156#1.offset; [2025-02-08 13:27:49,666 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-02-08 13:27:49,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret208#1; [2025-02-08 13:27:49,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret209#1; [2025-02-08 13:27:49,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: assume ~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0; [2025-02-08 13:27:49,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: assume !(~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0); [2025-02-08 13:27:49,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume { :begin_inline_my_xstrtod } true;my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtod_#res#1;havoc my_xstrtod_#t~ret161#1, my_xstrtod_#t~mem162#1, my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset := my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset;call my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset := #Ultimate.allocOnStack(8); [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret214#1; [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret215#1; [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2985: assume ~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0; [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2985: assume !(~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0); [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779-1: SUMMARY for call my_xstrtoll_#t~ret163#1 := multiconvert(my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, #funAddr~conv_strtoll.base, #funAddr~conv_strtoll.offset); srcloc: null [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: assume -2147483648 <= my_xstrtoll_#t~ret163#1 && my_xstrtoll_#t~ret163#1 <= 2147483647;my_xstrtoll_~return_value_multiconvert$1~0#1 := my_xstrtoll_#t~ret163#1;havoc my_xstrtoll_#t~ret163#1; [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret206#1; [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret207#1; [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: assume -2147483648 <= my_xstrtoull_#t~ret165#1 && my_xstrtoull_#t~ret165#1 <= 2147483647;my_xstrtoull_~return_value_multiconvert$1~1#1 := my_xstrtoull_#t~ret165#1;havoc my_xstrtoull_#t~ret165#1; [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788-1: SUMMARY for call my_xstrtoull_#t~ret165#1 := multiconvert(my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, #funAddr~conv_strtoull.base, #funAddr~conv_strtoull.offset); srcloc: null [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume !(0 == my_xstrtoll_~return_value_multiconvert$1~0#1);call write~int(0, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, 8); [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume !!(0 == my_xstrtoll_~return_value_multiconvert$1~0#1); [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772: assume -2147483648 <= my_xstrtod_#t~ret161#1 && my_xstrtod_#t~ret161#1 <= 2147483647;havoc my_xstrtod_#t~ret161#1;call my_xstrtod_#t~mem162#1 := read~real(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset, 8);my_xstrtod_#res#1 := my_xstrtod_#t~mem162#1;havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-02-08 13:27:49,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772-1: SUMMARY for call my_xstrtod_#t~ret161#1 := multiconvert(my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset, #funAddr~conv_strtod.base, #funAddr~conv_strtod.offset); srcloc: null [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret212#1; [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret213#1; [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2789: assume !(0 == my_xstrtoull_~return_value_multiconvert$1~1#1);call write~int(0, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, 8); [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2789: assume !!(0 == my_xstrtoull_~return_value_multiconvert$1~1#1); [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;#t~ret211#1 := my_xstrtod_#res#1;havoc my_xstrtod_#t~ret161#1, my_xstrtod_#t~mem162#1, my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;havoc my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset;assume { :end_inline_my_xstrtod } true;~dv~0#1 := #t~ret211#1;havoc #t~ret211#1; [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2980: ~llv~0#1 := ~argument#1.base + ~argument#1.offset; [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset;#t~ret205#1 := my_xstrtoll_#res#1;havoc my_xstrtoll_#t~ret163#1, my_xstrtoll_#t~mem164#1, my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, my_xstrtoll_~return_value_multiconvert$1~0#1;havoc my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset;assume { :end_inline_my_xstrtoll } true;assume -9223372036854775808 <= #t~ret205#1 && #t~ret205#1 <= 9223372036854775807;~llv~0#1 := #t~ret205#1;havoc #t~ret205#1; [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782-2: call my_xstrtoll_#t~mem164#1 := read~int(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, 8);my_xstrtoll_#res#1 := my_xstrtoll_#t~mem164#1;havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: assume { :begin_inline_my_xstrtoll } true;my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtoll_#res#1;havoc my_xstrtoll_#t~ret163#1, my_xstrtoll_#t~mem164#1, my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, my_xstrtoll_~return_value_multiconvert$1~0#1;my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset := my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset;call my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset := #Ultimate.allocOnStack(8);havoc my_xstrtoll_~return_value_multiconvert$1~0#1; [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset;#t~ret210#1 := my_xstrtoull_#res#1;havoc my_xstrtoull_#t~ret165#1, my_xstrtoull_#t~mem166#1, my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, my_xstrtoull_~return_value_multiconvert$1~1#1;havoc my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset;assume { :end_inline_my_xstrtoull } true;~return_value_my_xstrtoull$2~0#1 := #t~ret210#1;havoc #t~ret210#1;~llv~0#1 := (if ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 else ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); [2025-02-08 13:27:49,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791-2: call my_xstrtoull_#t~mem166#1 := read~int(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, 8);my_xstrtoull_#res#1 := my_xstrtoull_#t~mem166#1;havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-02-08 13:27:49,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: havoc ~return_value_my_xstrtoull$2~0#1;assume { :begin_inline_my_xstrtoull } true;my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtoull_#res#1;havoc my_xstrtoull_#t~ret165#1, my_xstrtoull_#t~mem166#1, my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, my_xstrtoull_~return_value_multiconvert$1~1#1;my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset := my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset;call my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset := #Ultimate.allocOnStack(8);havoc my_xstrtoull_~return_value_multiconvert$1~1#1; [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret314#1, safe_write_#t~mem315#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~4#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~1#1;havoc safe_write_~tmp_if_expr$1~4#1; [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698: full_write_#t~ret144#1 := safe_write_#res#1;havoc safe_write_#t~ret314#1, safe_write_#t~mem315#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~4#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret144#1 && full_write_#t~ret144#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret144#1;havoc full_write_#t~ret144#1; [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243-1: assume 0 != safe_write_~tmp_if_expr$1~4#1 % 256; [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243-1: assume !(0 != safe_write_~tmp_if_expr$1~4#1 % 256); [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet355#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet355#1;assume -9223372036854775808 <= write_#t~nondet355#1 && write_#t~nondet355#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet355#1;havoc write_#t~nondet355#1; [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: assume !true; [2025-02-08 13:27:50,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3252-1: safe_write_#res#1 := safe_write_~n~1#1; [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: assume full_write_~cc~0#1 < 0; [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3245: safe_write_#t~ret314#1 := write_#res#1;havoc write_#t~nondet355#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret314#1 && safe_write_#t~ret314#1 <= 9223372036854775807;safe_write_~n~1#1 := safe_write_#t~ret314#1;havoc safe_write_#t~ret314#1; [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394: write_#res#1 := write_~ret~1#1; [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: assume safe_write_~n~1#1 < 0;call safe_write_#t~mem315#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~4#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem315#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: assume !(safe_write_~n~1#1 < 0);safe_write_~tmp_if_expr$1~4#1 := 0; [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2701: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2701: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2635: #t~ret129#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet143#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret129#1 && #t~ret129#1 <= 2147483647;havoc #t~ret129#1;call #t~mem130#1.base, #t~mem130#1.offset := read~$Pointer$(~#msg~0#1.base, ~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, #t~mem130#1.base, #t~mem130#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret144#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:27:50,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636: #t~ret131#1 := full_write_#res#1;havoc full_write_#t~ret144#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= #t~ret131#1 && #t~ret131#1 <= 9223372036854775807;havoc #t~mem130#1.base, #t~mem130#1.offset;havoc #t~ret131#1; [2025-02-08 13:27:56,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-02-08 13:27:56,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume !(__main_~argv#1.base == __main_~argv2~0#1.base && __main_~argv#1.offset >= __main_~argv2~0#1.offset);call __main_#t~mem311#1.base, __main_#t~mem311#1.offset := read~$Pointer$(__main_~argv2~0#1.base, __main_~argv2~0#1.offset, 8);__main_~tmp_if_expr$2~1#1 := (if 0 == (if 0 != (if __main_#t~mem311#1.base != 0 || __main_#t~mem311#1.offset != 0 then 1 else 0) then 1 else 0) then 0 else 1);havoc __main_#t~mem311#1.base, __main_#t~mem311#1.offset; [2025-02-08 13:27:56,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume !!(__main_~argv#1.base == __main_~argv2~0#1.base && __main_~argv#1.offset >= __main_~argv2~0#1.offset);__main_~tmp_if_expr$2~1#1 := 0; [2025-02-08 13:27:56,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset;__main_#t~ret310#1.base, __main_#t~ret310#1.offset := print_formatted_#res#1.base, print_formatted_#res#1.offset;havoc print_formatted_#t~mem222#1.base, print_formatted_#t~mem222#1.offset, print_formatted_#t~mem223#1, print_formatted_#t~mem224#1.base, print_formatted_#t~mem224#1.offset, print_formatted_#t~mem225#1, print_formatted_#t~mem226#1.base, print_formatted_#t~mem226#1.offset, print_formatted_#t~mem227#1, print_formatted_#t~mem228#1.base, print_formatted_#t~mem228#1.offset, print_formatted_#t~mem229#1.base, print_formatted_#t~mem229#1.offset, print_formatted_#t~mem230#1.base, print_formatted_#t~mem230#1.offset, print_formatted_#t~mem231#1, print_formatted_#t~ret232#1, print_formatted_#t~mem233#1.base, print_formatted_#t~mem233#1.offset, print_formatted_#t~mem234#1, print_formatted_#t~mem235#1.base, print_formatted_#t~mem235#1.offset, print_formatted_#t~mem236#1.base, print_formatted_#t~mem236#1.offset, print_formatted_#t~mem237#1.base, print_formatted_#t~mem237#1.offset, print_formatted_#t~mem238#1, print_formatted_#t~nondet239#1.base, print_formatted_#t~nondet239#1.offset, print_formatted_#t~mem240#1.base, print_formatted_#t~mem240#1.offset, print_formatted_#t~mem241#1, print_formatted_#t~mem242#1.base, print_formatted_#t~mem242#1.offset, print_formatted_#t~mem243#1.base, print_formatted_#t~mem243#1.offset, print_formatted_#t~mem244#1, print_formatted_#t~mem245#1.base, print_formatted_#t~mem245#1.offset, print_formatted_#t~mem246#1.base, print_formatted_#t~mem246#1.offset, print_formatted_#t~mem247#1.base, print_formatted_#t~mem247#1.offset, print_formatted_#t~ret248#1, print_formatted_#t~mem249#1.base, print_formatted_#t~mem249#1.offset, print_formatted_#t~mem250#1, print_formatted_#t~mem251#1.base, print_formatted_#t~mem251#1.offset, print_formatted_#t~mem252#1.base, print_formatted_#t~mem252#1.offset, print_formatted_#t~mem253#1, print_formatted_#t~mem254#1.base, print_formatted_#t~mem254#1.offset, print_formatted_#t~mem255#1.base, print_formatted_#t~mem255#1.offset, print_formatted_#t~mem256#1, print_formatted_#t~mem257#1.base, print_formatted_#t~mem257#1.offset, print_formatted_#t~mem258#1.base, print_formatted_#t~mem258#1.offset, print_formatted_#t~mem259#1.base, print_formatted_#t~mem259#1.offset, print_formatted_#t~ret260#1, print_formatted_#t~mem261#1.base, print_formatted_#t~mem261#1.offset, print_formatted_#t~mem262#1, print_formatted_#t~mem263#1.base, print_formatted_#t~mem263#1.offset, print_formatted_#t~mem264#1.base, print_formatted_#t~mem264#1.offset, print_formatted_#t~mem265#1, print_formatted_#t~bitwise266#1, print_formatted_#t~mem267#1.base, print_formatted_#t~mem267#1.offset, print_formatted_#t~mem268#1, print_formatted_#t~mem269#1.base, print_formatted_#t~mem269#1.offset, print_formatted_#t~mem270#1, print_formatted_#t~mem271#1.base, print_formatted_#t~mem271#1.offset, print_formatted_#t~mem272#1.base, print_formatted_#t~mem272#1.offset, print_formatted_#t~mem273#1.base, print_formatted_#t~mem273#1.offset, print_formatted_#t~mem274#1, print_formatted_#t~nondet275#1.base, print_formatted_#t~nondet275#1.offset, print_formatted_#t~mem276#1.base, print_formatted_#t~mem276#1.offset, print_formatted_#t~mem277#1, print_formatted_#t~short278#1, print_formatted_#t~varargs279#1.base, print_formatted_#t~varargs279#1.offset, print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset, print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset, print_formatted_#t~mem282#1, print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset, print_formatted_#t~mem283#1.base, print_formatted_#t~mem283#1.offset, print_formatted_#t~mem284#1.base, print_formatted_#t~mem284#1.offset, print_formatted_#t~mem285#1, print_formatted_#t~mem286#1, print_formatted_#t~bitwise287#1, print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset, print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset, print_formatted_#t~mem290#1, print_formatted_#t~ret291#1, print_formatted_#t~ret292#1, print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset, print_formatted_#t~mem294#1.base, print_formatted_#t~mem294#1.offset, print_formatted_#t~mem295#1, print_formatted_#t~nondet296#1, print_formatted_#t~mem297#1.base, print_formatted_#t~mem297#1.offset, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, print_formatted_~argv#1.base, print_formatted_~argv#1.offset, print_formatted_~conv_err#1.base, print_formatted_~conv_err#1.offset, print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset, print_formatted_~direc_length~0#1, print_formatted_~field_width~0#1, print_formatted_~precision~0#1, print_formatted_~saved_argv~0#1.base, print_formatted_~saved_argv~0#1.offset, print_formatted_~tmp_post$1~0#1.base, print_formatted_~tmp_post$1~0#1.offset, print_formatted_~return_value___builtin_strchr$2~0#1.base, print_formatted_~return_value___builtin_strchr$2~0#1.offset, print_formatted_~tmp_post$3~0#1.base, print_formatted_~tmp_post$3~0#1.offset, print_formatted_~tmp_post$4~0#1.base, print_formatted_~tmp_post$4~0#1.offset, print_formatted_~tmp_post$7~1#1.base, print_formatted_~tmp_post$7~1#1.offset, print_formatted_~return_value_bb_process_escape_sequence$8~0#1;havoc print_formatted_#in~f#1.base, print_formatted_#in~f#1.offset, print_formatted_#in~argv#1.base, print_formatted_#in~argv#1.offset, print_formatted_#in~conv_err#1.base, print_formatted_#in~conv_err#1.offset;assume { :end_inline_print_formatted } true;__main_~argv2~0#1.base, __main_~argv2~0#1.offset := __main_#t~ret310#1.base, __main_#t~ret310#1.offset;havoc __main_#t~ret310#1.base, __main_#t~ret310#1.offset; [2025-02-08 13:27:56,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169: call print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);call write~$Pointer$(print_formatted_#t~mem288#1.base, 1 + print_formatted_#t~mem288#1.offset, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);havoc print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset;call print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);call print_formatted_#t~mem290#1 := read~int(print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset, 1); [2025-02-08 13:27:56,706 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset := xmalloc_#res#1.base, xmalloc_#res#1.offset;havoc xmalloc_#t~malloc318#1.base, xmalloc_#t~malloc318#1.offset, xmalloc_#t~varargs319#1.base, xmalloc_#t~varargs319#1.offset, xmalloc_~size#1, xmalloc_~ptr~0#1.base, xmalloc_~ptr~0#1.offset;havoc xmalloc_#in~size#1;assume { :end_inline_xmalloc } true;print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset := print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset;havoc print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset;print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset := print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset;assume { :begin_inline_#Ultimate.C_memcpy } true;#Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset, #Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset, #Ultimate.C_memcpy_size#1 := print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset, print_formatted_~direc_length~0#1 % 4294967296;havoc #Ultimate.C_memcpy_#res#1.base, #Ultimate.C_memcpy_#res#1.offset;havoc #Ultimate.C_memcpy_#t~loopctr374#1, #Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_#t~loopctr381#1, #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset;#Ultimate.C_memcpy_#t~loopctr374#1 := 0; [2025-02-08 13:27:56,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume 99 == print_formatted_#t~mem290#1;havoc print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset;havoc print_formatted_#t~mem290#1;print_formatted_#res#1.base, print_formatted_#res#1.offset := print_formatted_~saved_argv~0#1.base, print_formatted_~saved_argv~0#1.offset;call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-02-08 13:27:56,707 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume !(99 == print_formatted_#t~mem290#1);havoc print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset;havoc print_formatted_#t~mem290#1; [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume #Ultimate.C_memcpy_#t~loopctr381#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616;call #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset := read~unchecked~$Pointer$(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr381#1, 8);call write~unchecked~$Pointer$(#Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr381#1, 8);#Ultimate.C_memcpy_#t~loopctr381#1 := 8 + #Ultimate.C_memcpy_#t~loopctr381#1; [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume !(#Ultimate.C_memcpy_#t~loopctr381#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616);assume #Ultimate.C_memcpy_#res#1.base == #Ultimate.C_memcpy_dest#1.base && #Ultimate.C_memcpy_#res#1.offset == #Ultimate.C_memcpy_dest#1.offset;print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset := #Ultimate.C_memcpy_#res#1.base, #Ultimate.C_memcpy_#res#1.offset;havoc #Ultimate.C_memcpy_#t~loopctr374#1, #Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_#t~loopctr381#1, #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset;havoc #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset, #Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset, #Ultimate.C_memcpy_size#1;assume { :end_inline_#Ultimate.C_memcpy } true;havoc print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset;call print_formatted_#t~mem282#1 := read~int(print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);call write~int(print_formatted_#t~mem282#1, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 else (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);havoc print_formatted_#t~mem282#1;call write~int(108, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);call write~int(108, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 else print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);print_formatted_~direc_length~0#1 := 2 + print_formatted_~direc_length~0#1;print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset := print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset;havoc print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset; [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume #Ultimate.C_memcpy_#t~loopctr374#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616;call #Ultimate.C_memcpy_#t~mem375#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 4);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 4);call #Ultimate.C_memcpy_#t~mem376#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem377#1 := read~unchecked~real(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~real(#Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem378#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 2);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 2);call #Ultimate.C_memcpy_#t~mem379#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 1);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 1);call #Ultimate.C_memcpy_#t~mem380#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);#Ultimate.C_memcpy_#t~loopctr374#1 := 1 + #Ultimate.C_memcpy_#t~loopctr374#1; [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume !(#Ultimate.C_memcpy_#t~loopctr374#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616);#Ultimate.C_memcpy_#t~loopctr381#1 := 0; [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220-1: assume 0 != __main_~tmp_if_expr$2~1#1 % 256; [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220-1: assume !(0 != __main_~tmp_if_expr$2~1#1 % 256); [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172: assume -128 <= print_formatted_#t~ret291#1 && print_formatted_#t~ret291#1 <= 127;print_formatted_~return_value_bb_process_escape_sequence$8~0#1 := print_formatted_#t~ret291#1;havoc print_formatted_#t~ret291#1; [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172-1: SUMMARY for call print_formatted_#t~ret291#1 := bb_process_escape_sequence(print_formatted_~#f#1.base, print_formatted_~#f#1.offset); srcloc: null [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173-1: SUMMARY for call print_formatted_#t~ret292#1 := bb_putchar(print_formatted_~return_value_bb_process_escape_sequence$8~0#1); srcloc: null [2025-02-08 13:27:56,708 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: assume -2147483648 <= print_formatted_#t~ret292#1 && print_formatted_#t~ret292#1 <= 2147483647;havoc print_formatted_#t~ret292#1;call print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);call write~$Pointer$(print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset - 1, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);havoc print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset; [2025-02-08 13:27:56,819 INFO L? ?]: Removed 516 outVars from TransFormulas that were not future-live. [2025-02-08 13:27:56,819 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:27:56,866 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:27:56,868 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:27:56,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:27:56 BoogieIcfgContainer [2025-02-08 13:27:56,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:27:56,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:27:56,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:27:56,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:27:56,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:27:46" (1/3) ... [2025-02-08 13:27:56,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7329e14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:27:56, skipping insertion in model container [2025-02-08 13:27:56,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:48" (2/3) ... [2025-02-08 13:27:56,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7329e14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:27:56, skipping insertion in model container [2025-02-08 13:27:56,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:27:56" (3/3) ... [2025-02-08 13:27:56,878 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-02-08 13:27:56,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:27:56,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 433 locations, 1 initial locations, 23 loop locations, and 44 error locations. [2025-02-08 13:27:56,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:27:56,970 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;@5acac23a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:27:56,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-08 13:27:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 417 states, 304 states have (on average 1.6151315789473684) internal successors, (491), 372 states have internal predecessors, (491), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-08 13:27:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:27:56,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:56,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:27:56,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:27:56,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 765571, now seen corresponding path program 1 times [2025-02-08 13:27:56,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:56,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197761799] [2025-02-08 13:27:56,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:56,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:57,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:27:58,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:27:58,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:58,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:27:58,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:58,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197761799] [2025-02-08 13:27:58,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197761799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:58,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:58,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:27:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376121453] [2025-02-08 13:27:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:58,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:58,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:58,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:58,659 INFO L87 Difference]: Start difference. First operand has 417 states, 304 states have (on average 1.6151315789473684) internal successors, (491), 372 states have internal predecessors, (491), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-08 13:27:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:58,818 INFO L93 Difference]: Finished difference Result 652 states and 938 transitions. [2025-02-08 13:27:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:58,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-02-08 13:27:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:58,831 INFO L225 Difference]: With dead ends: 652 [2025-02-08 13:27:58,831 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 13:27:58,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-08 13:27:58,839 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:58,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 741 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 13:27:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-08 13:27:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 145 states have internal predecessors, (182), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:27:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2025-02-08 13:27:58,897 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 3 [2025-02-08 13:27:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:58,897 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2025-02-08 13:27:58,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-08 13:27:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2025-02-08 13:27:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:27:58,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:58,898 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:27:58,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:27:58,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:27:58,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1332990365, now seen corresponding path program 1 times [2025-02-08 13:27:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:58,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820316679] [2025-02-08 13:27:58,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:58,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:59,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:27:59,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:27:59,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:59,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:59,921 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-08 13:27:59,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:59,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820316679] [2025-02-08 13:27:59,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820316679] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:59,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068011564] [2025-02-08 13:27:59,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:59,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:59,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:59,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:27:59,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:28:00,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:28:01,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:28:01,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:01,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:01,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:01,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:01,128 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-08 13:28:01,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:01,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068011564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:01,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:01,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:28:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365312755] [2025-02-08 13:28:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:01,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:28:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:01,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:28:01,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:01,130 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 13:28:05,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:05,262 INFO L93 Difference]: Finished difference Result 166 states and 210 transitions. [2025-02-08 13:28:05,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:28:05,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-08 13:28:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:05,264 INFO L225 Difference]: With dead ends: 166 [2025-02-08 13:28:05,264 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 13:28:05,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:05,265 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:05,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 13:28:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 13:28:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 144 states have internal predecessors, (181), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2025-02-08 13:28:05,275 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 6 [2025-02-08 13:28:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:05,275 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2025-02-08 13:28:05,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 13:28:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2025-02-08 13:28:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:28:05,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:05,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:28:05,288 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-08 13:28:05,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:05,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:05,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1626970939, now seen corresponding path program 1 times [2025-02-08 13:28:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:05,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498647594] [2025-02-08 13:28:05,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:05,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:28:05,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:28:06,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:06,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:06,174 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-08 13:28:06,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498647594] [2025-02-08 13:28:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498647594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:06,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:06,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032568043] [2025-02-08 13:28:06,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:06,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:06,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:06,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:06,203 INFO L87 Difference]: Start difference. First operand 165 states and 209 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-08 13:28:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:06,276 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2025-02-08 13:28:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:06,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-08 13:28:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:06,277 INFO L225 Difference]: With dead ends: 165 [2025-02-08 13:28:06,278 INFO L226 Difference]: Without dead ends: 164 [2025-02-08 13:28:06,278 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-08 13:28:06,279 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:06,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:28:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-08 13:28:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-02-08 13:28:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 141 states have internal predecessors, (178), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 206 transitions. [2025-02-08 13:28:06,292 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 206 transitions. Word has length 7 [2025-02-08 13:28:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:06,292 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 206 transitions. [2025-02-08 13:28:06,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-08 13:28:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 206 transitions. [2025-02-08 13:28:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:28:06,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:06,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:28:06,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:06,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1383615125, now seen corresponding path program 1 times [2025-02-08 13:28:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962961758] [2025-02-08 13:28:06,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:06,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:28:06,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:28:06,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:06,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:07,199 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-08 13:28:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962961758] [2025-02-08 13:28:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962961758] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318863541] [2025-02-08 13:28:07,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:07,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:07,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:07,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:28:08,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:28:08,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:28:08,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:08,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:08,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:28:08,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:08,286 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-08 13:28:08,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:08,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318863541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:08,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:08,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:28:08,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836188928] [2025-02-08 13:28:08,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:08,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:08,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:08,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:08,289 INFO L87 Difference]: Start difference. First operand 162 states and 206 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-08 13:28:12,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:12,413 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2025-02-08 13:28:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:12,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2025-02-08 13:28:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:12,415 INFO L225 Difference]: With dead ends: 162 [2025-02-08 13:28:12,415 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 13:28:12,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-08 13:28:12,416 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 101 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:12,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 285 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 13:28:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 13:28:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 139 states have internal predecessors, (176), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2025-02-08 13:28:12,440 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 11 [2025-02-08 13:28:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:12,440 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2025-02-08 13:28:12,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-08 13:28:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2025-02-08 13:28:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:28:12,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:12,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:12,454 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-08 13:28:12,641 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-08 13:28:12,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:12,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:12,642 INFO L85 PathProgramCache]: Analyzing trace with hash 57604785, now seen corresponding path program 1 times [2025-02-08 13:28:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:12,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733149133] [2025-02-08 13:28:12,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:13,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:28:13,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:28:13,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:13,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:13,670 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-08 13:28:13,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:13,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733149133] [2025-02-08 13:28:13,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733149133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:13,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697667315] [2025-02-08 13:28:13,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:13,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:13,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:13,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:13,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:28:14,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:28:14,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:28:14,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:14,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:14,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:14,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:14,769 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-08 13:28:14,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:14,824 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-08 13:28:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697667315] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:14,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:28:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44240489] [2025-02-08 13:28:14,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:14,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:14,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:14,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:14,826 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-08 13:28:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:14,892 INFO L93 Difference]: Finished difference Result 324 states and 414 transitions. [2025-02-08 13:28:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 12 [2025-02-08 13:28:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:14,894 INFO L225 Difference]: With dead ends: 324 [2025-02-08 13:28:14,894 INFO L226 Difference]: Without dead ends: 169 [2025-02-08 13:28:14,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:14,895 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 4 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:14,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 394 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:28:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-08 13:28:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-02-08 13:28:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 148 states have internal predecessors, (185), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2025-02-08 13:28:14,903 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 12 [2025-02-08 13:28:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:14,903 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2025-02-08 13:28:14,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-08 13:28:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2025-02-08 13:28:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:28:14,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:14,904 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:14,916 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-08 13:28:15,104 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-08 13:28:15,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:15,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash -951318889, now seen corresponding path program 2 times [2025-02-08 13:28:15,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:15,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655342836] [2025-02-08 13:28:15,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:28:15,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:15,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:28:15,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:28:15,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:28:15,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:15,981 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-08 13:28:15,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:15,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655342836] [2025-02-08 13:28:15,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655342836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:15,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:15,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:28:15,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625958450] [2025-02-08 13:28:15,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:15,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:28:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:15,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:28:15,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:15,984 INFO L87 Difference]: Start difference. First operand 169 states and 213 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-08 13:28:20,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:20,181 INFO L93 Difference]: Finished difference Result 169 states and 213 transitions. [2025-02-08 13:28:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:28:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 21 [2025-02-08 13:28:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:20,183 INFO L225 Difference]: With dead ends: 169 [2025-02-08 13:28:20,183 INFO L226 Difference]: Without dead ends: 167 [2025-02-08 13:28:20,183 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-08 13:28:20,184 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 100 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:20,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 657 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:28:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-08 13:28:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-02-08 13:28:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 146 states have internal predecessors, (183), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 211 transitions. [2025-02-08 13:28:20,196 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 211 transitions. Word has length 21 [2025-02-08 13:28:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:20,196 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 211 transitions. [2025-02-08 13:28:20,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-08 13:28:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 211 transitions. [2025-02-08 13:28:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:28:20,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:20,197 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:20,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:28:20,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:20,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1319534464, now seen corresponding path program 1 times [2025-02-08 13:28:20,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:20,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112621835] [2025-02-08 13:28:20,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:20,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:28:20,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:28:20,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:20,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:20,924 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-08 13:28:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112621835] [2025-02-08 13:28:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112621835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:20,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:20,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:20,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109062866] [2025-02-08 13:28:20,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:20,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:20,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:20,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:20,926 INFO L87 Difference]: Start difference. First operand 167 states and 211 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-08 13:28:24,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:25,036 INFO L93 Difference]: Finished difference Result 314 states and 404 transitions. [2025-02-08 13:28:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:25,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 26 [2025-02-08 13:28:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:25,038 INFO L225 Difference]: With dead ends: 314 [2025-02-08 13:28:25,038 INFO L226 Difference]: Without dead ends: 170 [2025-02-08 13:28:25,039 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-08 13:28:25,039 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:25,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-08 13:28:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-08 13:28:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 149 states have internal predecessors, (186), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2025-02-08 13:28:25,051 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 26 [2025-02-08 13:28:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:25,051 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2025-02-08 13:28:25,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-08 13:28:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2025-02-08 13:28:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:28:25,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:25,052 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:25,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:28:25,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:25,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1583757968, now seen corresponding path program 1 times [2025-02-08 13:28:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494203033] [2025-02-08 13:28:25,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:25,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:25,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:25,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:25,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:25,832 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-08 13:28:25,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494203033] [2025-02-08 13:28:25,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494203033] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827132958] [2025-02-08 13:28:25,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:25,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:25,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:25,835 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-08 13:28:25,838 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-08 13:28:26,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:26,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:26,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:26,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:26,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1921 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:28:26,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:27,145 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-08 13:28:27,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:27,342 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-08 13:28:27,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827132958] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:27,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:27,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:28:27,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722111112] [2025-02-08 13:28:27,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:27,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:28:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:27,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:28:27,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:28:27,344 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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-08 13:28:31,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:35,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:35,677 INFO L93 Difference]: Finished difference Result 343 states and 437 transitions. [2025-02-08 13:28:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:28:35,678 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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 29 [2025-02-08 13:28:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:35,679 INFO L225 Difference]: With dead ends: 343 [2025-02-08 13:28:35,679 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 13:28:35,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:28:35,680 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 5 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:35,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1130 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-08 13:28:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 13:28:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-08 13:28:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 157 states have (on average 1.2929936305732483) internal successors, (203), 166 states have internal predecessors, (203), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 231 transitions. [2025-02-08 13:28:35,688 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 231 transitions. Word has length 29 [2025-02-08 13:28:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:35,688 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 231 transitions. [2025-02-08 13:28:35,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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-08 13:28:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 231 transitions. [2025-02-08 13:28:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:28:35,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:35,690 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] [2025-02-08 13:28:35,702 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-08 13:28:35,890 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,SelfDestructingSolverStorable7 [2025-02-08 13:28:35,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:35,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:35,891 INFO L85 PathProgramCache]: Analyzing trace with hash -951084528, now seen corresponding path program 1 times [2025-02-08 13:28:35,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:35,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429549736] [2025-02-08 13:28:35,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:35,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:36,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:28:36,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:28:36,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:36,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:36,761 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-08 13:28:36,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:36,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429549736] [2025-02-08 13:28:36,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429549736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:36,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:36,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523257547] [2025-02-08 13:28:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:36,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:36,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:36,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:36,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:36,762 INFO L87 Difference]: Start difference. First operand 187 states and 231 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 13:28:40,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:40,879 INFO L93 Difference]: Finished difference Result 199 states and 245 transitions. [2025-02-08 13:28:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 47 [2025-02-08 13:28:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:40,882 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:28:40,882 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 13:28:40,882 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-08 13:28:40,883 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 2 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:40,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 382 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 13:28:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2025-02-08 13:28:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 166 states have (on average 1.2951807228915662) internal successors, (215), 175 states have internal predecessors, (215), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 243 transitions. [2025-02-08 13:28:40,894 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 243 transitions. Word has length 47 [2025-02-08 13:28:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:40,895 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 243 transitions. [2025-02-08 13:28:40,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 13:28:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 243 transitions. [2025-02-08 13:28:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:28:40,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:40,896 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] [2025-02-08 13:28:40,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:28:40,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:40,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1276913653, now seen corresponding path program 1 times [2025-02-08 13:28:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:40,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014628709] [2025-02-08 13:28:40,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:41,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:28:41,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:28:41,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:41,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:41,626 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-08 13:28:41,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:41,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014628709] [2025-02-08 13:28:41,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014628709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:41,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:41,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:41,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473363355] [2025-02-08 13:28:41,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:41,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:41,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:41,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:41,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:41,629 INFO L87 Difference]: Start difference. First operand 196 states and 243 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 13:28:45,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:45,722 INFO L93 Difference]: Finished difference Result 201 states and 248 transitions. [2025-02-08 13:28:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 47 [2025-02-08 13:28:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:45,724 INFO L225 Difference]: With dead ends: 201 [2025-02-08 13:28:45,724 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:28:45,724 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-08 13:28:45,725 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:45,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 386 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:28:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:28:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 178 states have internal predecessors, (218), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 246 transitions. [2025-02-08 13:28:45,733 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 246 transitions. Word has length 47 [2025-02-08 13:28:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:45,733 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 246 transitions. [2025-02-08 13:28:45,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 13:28:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 246 transitions. [2025-02-08 13:28:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:28:45,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:45,734 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:45,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:28:45,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:45,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:45,735 INFO L85 PathProgramCache]: Analyzing trace with hash 581156354, now seen corresponding path program 1 times [2025-02-08 13:28:45,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:45,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465679746] [2025-02-08 13:28:45,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:45,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:46,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:28:46,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:28:46,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:46,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:46,361 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-08 13:28:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465679746] [2025-02-08 13:28:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465679746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:46,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:46,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325349913] [2025-02-08 13:28:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:46,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:46,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:46,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:46,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:46,363 INFO L87 Difference]: Start difference. First operand 199 states and 246 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-08 13:28:50,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:50,448 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2025-02-08 13:28:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:50,450 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-08 13:28:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:50,451 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:28:50,452 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:28:50,452 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-08 13:28:50,452 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:50,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:28:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2025-02-08 13:28:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 165 states have (on average 1.284848484848485) internal successors, (212), 173 states have internal predecessors, (212), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 240 transitions. [2025-02-08 13:28:50,464 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 240 transitions. Word has length 48 [2025-02-08 13:28:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:50,464 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 240 transitions. [2025-02-08 13:28:50,465 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-08 13:28:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 240 transitions. [2025-02-08 13:28:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:28:50,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:50,467 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:50,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:28:50,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:50,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash -8829015, now seen corresponding path program 1 times [2025-02-08 13:28:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036093186] [2025-02-08 13:28:50,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:50,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:50,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:28:50,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:28:50,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:50,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:51,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:51,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036093186] [2025-02-08 13:28:51,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036093186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:51,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536278692] [2025-02-08 13:28:51,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:51,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:51,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:51,183 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-08 13:28:51,185 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-08 13:28:52,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:28:52,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:28:52,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:52,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:52,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 2027 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:28:52,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:28:52,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:52,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536278692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:52,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:52,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-08 13:28:52,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636568387] [2025-02-08 13:28:52,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:52,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:52,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:52,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:52,474 INFO L87 Difference]: Start difference. First operand 194 states and 240 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) 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-08 13:28:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:52,509 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2025-02-08 13:28:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) 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 50 [2025-02-08 13:28:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:52,512 INFO L225 Difference]: With dead ends: 203 [2025-02-08 13:28:52,512 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 13:28:52,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:52,513 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:52,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 13:28:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 13:28:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 165 states have (on average 1.2787878787878788) internal successors, (211), 173 states have internal predecessors, (211), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2025-02-08 13:28:52,522 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 50 [2025-02-08 13:28:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:52,523 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2025-02-08 13:28:52,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) 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-08 13:28:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2025-02-08 13:28:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:28:52,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:52,524 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] [2025-02-08 13:28:52,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:28:52,725 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-08 13:28:52,725 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:28:52,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2053068120, now seen corresponding path program 1 times [2025-02-08 13:28:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534580164] [2025-02-08 13:28:52,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:53,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:28:53,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:28:53,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:53,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:53,401 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-08 13:28:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534580164] [2025-02-08 13:28:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534580164] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806952491] [2025-02-08 13:28:53,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:53,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:53,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:53,404 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-08 13:28:53,405 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-08 13:28:54,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:28:54,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:28:54,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:54,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:54,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 2126 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:54,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:54,737 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-08 13:28:54,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:54,800 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-08 13:28:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806952491] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:54,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:54,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:28:54,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729594492] [2025-02-08 13:28:54,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:54,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:54,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:54,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:54,801 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-08 13:28:58,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:02,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:06,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:10,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:14,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:15,050 INFO L93 Difference]: Finished difference Result 360 states and 453 transitions. [2025-02-08 13:29:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:29:15,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 54 [2025-02-08 13:29:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:15,052 INFO L225 Difference]: With dead ends: 360 [2025-02-08 13:29:15,053 INFO L226 Difference]: Without dead ends: 212 [2025-02-08 13:29:15,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:29:15,053 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 4 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:15,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 573 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-02-08 13:29:15,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-08 13:29:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-02-08 13:29:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 183 states have (on average 1.2513661202185793) internal successors, (229), 191 states have internal predecessors, (229), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:29:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 257 transitions. [2025-02-08 13:29:15,064 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 257 transitions. Word has length 54 [2025-02-08 13:29:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:15,064 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 257 transitions. [2025-02-08 13:29:15,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-08 13:29:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 257 transitions. [2025-02-08 13:29:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:29:15,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:15,068 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:29:15,083 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-08 13:29:15,268 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-08 13:29:15,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-02-08 13:29:15,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1889883838, now seen corresponding path program 1 times [2025-02-08 13:29:15,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:15,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372443012] [2025-02-08 13:29:15,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:15,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:15,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:29:15,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:29:15,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:15,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:29:15,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:15,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372443012] [2025-02-08 13:29:15,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372443012] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:15,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630292366] [2025-02-08 13:29:15,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:15,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:15,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:15,927 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-08 13:29:15,929 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