./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/printf-1.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 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:01:03,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:01:03,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 18:01:03,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:01:03,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:01:03,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:01:03,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:01:03,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:01:03,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:01:03,683 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:01:03,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:01:03,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:01:03,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:01:03,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:01:03,684 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:01:03,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:01:03,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:01:03,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:01:03,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:01:03,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:01:03,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:01:03,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:01:03,685 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:01:03,685 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:01:03,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:01:03,686 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:01:03,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:01:03,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:01:03,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:01:03,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:01:03,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:01:03,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:01:03,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:01:03,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:01:03,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:01:03,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:01:03,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:01:03,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:01:03,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:01:03,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:01:03,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:01:03,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:01:03,687 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 -> 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a [2025-02-06 18:01:03,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:01:03,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:01:03,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:01:03,932 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:01:03,932 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:01:03,933 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-1.i [2025-02-06 18:01:05,097 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec7a180a1/cec31a9d2bf24d498456819378258087/FLAG849b7c12d [2025-02-06 18:01:05,609 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:01:05,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-02-06 18:01:05,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec7a180a1/cec31a9d2bf24d498456819378258087/FLAG849b7c12d [2025-02-06 18:01:05,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec7a180a1/cec31a9d2bf24d498456819378258087 [2025-02-06 18:01:05,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:01:05,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:01:05,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:05,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:01:05,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:01:05,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:05" (1/1) ... [2025-02-06 18:01:05,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:05, skipping insertion in model container [2025-02-06 18:01:05,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:05" (1/1) ... [2025-02-06 18:01:05,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:01:06,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:06,676 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:01:06,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:07,001 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 18:01:07,008 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:01:07,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07 WrapperNode [2025-02-06 18:01:07,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:07,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:07,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:01:07,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:01:07,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,182 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1869 [2025-02-06 18:01:07,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:07,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:01:07,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:01:07,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:01:07,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,232 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 18:01:07,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:01:07,384 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:01:07,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:01:07,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:01:07,388 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (1/1) ... [2025-02-06 18:01:07,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:01:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:07,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:01:07,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:01:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 18:01:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-02-06 18:01:07,468 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-02-06 18:01:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:01:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 18:01:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-02-06 18:01:07,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-02-06 18:01:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 18:01:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 18:01:07,469 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 18:01:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 18:01:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 18:01:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-02-06 18:01:07,469 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-02-06 18:01:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 18:01:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:01:07,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:01:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 18:01:07,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:01:07,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:01:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 18:01:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 18:01:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 18:01:07,471 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 18:01:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 18:01:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 18:01:07,471 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-02-06 18:01:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-02-06 18:01:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 18:01:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-02-06 18:01:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-02-06 18:01:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-02-06 18:01:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-02-06 18:01:07,472 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-02-06 18:01:07,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-02-06 18:01:07,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 18:01:07,473 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-02-06 18:01:07,473 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-02-06 18:01:07,823 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:01:07,826 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:01:07,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-02-06 18:01:08,212 INFO L1309 $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; [2025-02-06 18:01:08,257 INFO L1309 $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-06 18:01:08,443 INFO L1309 $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; [2025-02-06 18:01:08,443 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-02-06 18:01:08,443 INFO L1309 $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; [2025-02-06 18:01:08,443 INFO L1309 $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; [2025-02-06 18:01:13,380 INFO L1309 $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-06 18:01:13,381 INFO L1309 $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; [2025-02-06 18:01:13,381 INFO L1309 $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-06 18:01:13,548 INFO L? ?]: Removed 636 outVars from TransFormulas that were not future-live. [2025-02-06 18:01:13,548 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:01:13,577 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:01:13,578 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:01:13,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:13 BoogieIcfgContainer [2025-02-06 18:01:13,578 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:01:13,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:01:13,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:01:13,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:01:13,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:01:05" (1/3) ... [2025-02-06 18:01:13,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704b61ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:13, skipping insertion in model container [2025-02-06 18:01:13,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:07" (2/3) ... [2025-02-06 18:01:13,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704b61ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:13, skipping insertion in model container [2025-02-06 18:01:13,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:13" (3/3) ... [2025-02-06 18:01:13,589 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-1.i [2025-02-06 18:01:13,603 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:01:13,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-1.i that has 15 procedures, 509 locations, 1 initial locations, 23 loop locations, and 52 error locations. [2025-02-06 18:01:13,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:01:13,679 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;@4b88f13a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:01:13,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-06 18:01:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 509 states, 390 states have (on average 1.582051282051282) internal successors, (617), 457 states have internal predecessors, (617), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 18:01:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 18:01:13,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:13,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 18:01:13,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:13,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash 24872447, now seen corresponding path program 1 times [2025-02-06 18:01:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:13,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902877910] [2025-02-06 18:01:13,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:14,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:01:14,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:01:14,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:14,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902877910] [2025-02-06 18:01:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902877910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:15,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985507260] [2025-02-06 18:01:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:15,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:15,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:15,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:15,268 INFO L87 Difference]: Start difference. First operand has 509 states, 390 states have (on average 1.582051282051282) internal successors, (617), 457 states have internal predecessors, (617), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:15,440 INFO L93 Difference]: Finished difference Result 902 states and 1339 transitions. [2025-02-06 18:01:15,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:15,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 18:01:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:15,458 INFO L225 Difference]: With dead ends: 902 [2025-02-06 18:01:15,458 INFO L226 Difference]: Without dead ends: 379 [2025-02-06 18:01:15,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:15,468 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1079 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-06 18:01:15,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-02-06 18:01:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-02-06 18:01:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 318 states have (on average 1.4245283018867925) internal successors, (453), 334 states have internal predecessors, (453), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2025-02-06 18:01:15,529 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 4 [2025-02-06 18:01:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:15,529 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2025-02-06 18:01:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2025-02-06 18:01:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:01:15,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:15,530 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:01:15,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:01:15,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:15,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2053536699, now seen corresponding path program 1 times [2025-02-06 18:01:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597084453] [2025-02-06 18:01:15,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:16,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:01:16,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:01:16,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:16,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:16,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597084453] [2025-02-06 18:01:16,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597084453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415058763] [2025-02-06 18:01:16,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:16,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:16,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:16,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:16,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:01:17,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:01:17,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:01:17,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:17,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:17,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 1683 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:17,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:17,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415058763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:17,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:01:17,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365626732] [2025-02-06 18:01:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:17,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:01:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:17,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:01:17,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:17,927 INFO L87 Difference]: Start difference. First operand 379 states and 520 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:18,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:18,079 INFO L93 Difference]: Finished difference Result 379 states and 520 transitions. [2025-02-06 18:01:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:01:18,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:01:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:18,085 INFO L225 Difference]: With dead ends: 379 [2025-02-06 18:01:18,085 INFO L226 Difference]: Without dead ends: 378 [2025-02-06 18:01:18,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-06 18:01:18,087 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 1 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:18,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1013 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-06 18:01:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-02-06 18:01:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 318 states have (on average 1.421383647798742) internal successors, (452), 333 states have internal predecessors, (452), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 519 transitions. [2025-02-06 18:01:18,115 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 519 transitions. Word has length 7 [2025-02-06 18:01:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:18,115 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 519 transitions. [2025-02-06 18:01:18,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 519 transitions. [2025-02-06 18:01:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:01:18,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:18,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:01:18,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:01:18,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:18,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:18,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:18,318 INFO L85 PathProgramCache]: Analyzing trace with hash 764872513, now seen corresponding path program 1 times [2025-02-06 18:01:18,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:18,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386462030] [2025-02-06 18:01:18,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:18,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:18,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:01:18,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:01:18,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:18,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:01:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:19,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386462030] [2025-02-06 18:01:19,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386462030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:19,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:19,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362026768] [2025-02-06 18:01:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:19,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:19,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:19,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:19,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:19,155 INFO L87 Difference]: Start difference. First operand 378 states and 519 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:19,234 INFO L93 Difference]: Finished difference Result 378 states and 519 transitions. [2025-02-06 18:01:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:19,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 18:01:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:19,237 INFO L225 Difference]: With dead ends: 378 [2025-02-06 18:01:19,237 INFO L226 Difference]: Without dead ends: 377 [2025-02-06 18:01:19,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:19,238 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 0 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:19,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1014 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-06 18:01:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2025-02-06 18:01:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 316 states have (on average 1.4208860759493671) internal successors, (449), 330 states have internal predecessors, (449), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 516 transitions. [2025-02-06 18:01:19,255 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 516 transitions. Word has length 8 [2025-02-06 18:01:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:19,255 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 516 transitions. [2025-02-06 18:01:19,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:01:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 516 transitions. [2025-02-06 18:01:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 18:01:19,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:19,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:19,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:01:19,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:19,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2128960762, now seen corresponding path program 1 times [2025-02-06 18:01:19,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:19,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555745606] [2025-02-06 18:01:19,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:19,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:19,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:01:19,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:01:19,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:19,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:20,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:20,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555745606] [2025-02-06 18:01:20,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555745606] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:20,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126223556] [2025-02-06 18:01:20,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:20,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:20,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:20,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:20,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:01:21,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:01:21,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:01:21,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:21,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:21,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:01:21,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:01:21,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:21,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126223556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:21,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:21,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 18:01:21,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023288743] [2025-02-06 18:01:21,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:21,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:21,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:21,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:21,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:21,535 INFO L87 Difference]: Start difference. First operand 375 states and 516 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:21,647 INFO L93 Difference]: Finished difference Result 375 states and 516 transitions. [2025-02-06 18:01:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:21,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-06 18:01:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:21,650 INFO L225 Difference]: With dead ends: 375 [2025-02-06 18:01:21,651 INFO L226 Difference]: Without dead ends: 373 [2025-02-06 18:01:21,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:21,652 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 163 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:21,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 832 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-06 18:01:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-02-06 18:01:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 316 states have (on average 1.4145569620253164) internal successors, (447), 328 states have internal predecessors, (447), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 514 transitions. [2025-02-06 18:01:21,685 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 514 transitions. Word has length 12 [2025-02-06 18:01:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:21,689 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 514 transitions. [2025-02-06 18:01:21,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 514 transitions. [2025-02-06 18:01:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 18:01:21,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:21,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:21,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:01:21,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:21,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:21,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1573273446, now seen corresponding path program 1 times [2025-02-06 18:01:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695763607] [2025-02-06 18:01:21,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:22,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:01:22,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:01:22,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:22,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:22,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695763607] [2025-02-06 18:01:22,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695763607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795670020] [2025-02-06 18:01:22,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:22,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:22,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:22,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:22,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:01:23,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:01:23,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:01:23,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:23,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:23,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:23,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:23,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:01:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795670020] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:24,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:24,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:01:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497969829] [2025-02-06 18:01:24,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:24,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:01:24,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:24,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:01:24,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:24,059 INFO L87 Difference]: Start difference. First operand 373 states and 514 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:24,195 INFO L93 Difference]: Finished difference Result 749 states and 1033 transitions. [2025-02-06 18:01:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:24,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-02-06 18:01:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:24,200 INFO L225 Difference]: With dead ends: 749 [2025-02-06 18:01:24,200 INFO L226 Difference]: Without dead ends: 382 [2025-02-06 18:01:24,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-06 18:01:24,201 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 4 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:24,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2018 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-06 18:01:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-02-06 18:01:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 325 states have (on average 1.403076923076923) internal successors, (456), 337 states have internal predecessors, (456), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 523 transitions. [2025-02-06 18:01:24,216 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 523 transitions. Word has length 13 [2025-02-06 18:01:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:24,216 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 523 transitions. [2025-02-06 18:01:24,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:01:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 523 transitions. [2025-02-06 18:01:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:01:24,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:24,217 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:24,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:01:24,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:24,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:24,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:24,421 INFO L85 PathProgramCache]: Analyzing trace with hash 406594388, now seen corresponding path program 2 times [2025-02-06 18:01:24,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:24,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410766295] [2025-02-06 18:01:24,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:01:24,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:24,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 18:01:24,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 18:01:24,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:01:24,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:25,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:25,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410766295] [2025-02-06 18:01:25,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410766295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:25,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:25,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:01:25,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987016915] [2025-02-06 18:01:25,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:25,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:01:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:25,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:01:25,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:25,391 INFO L87 Difference]: Start difference. First operand 382 states and 523 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:25,643 INFO L93 Difference]: Finished difference Result 382 states and 523 transitions. [2025-02-06 18:01:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:01:25,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 18:01:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:25,646 INFO L225 Difference]: With dead ends: 382 [2025-02-06 18:01:25,646 INFO L226 Difference]: Without dead ends: 380 [2025-02-06 18:01:25,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:01:25,647 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 162 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:25,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1815 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:01:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-06 18:01:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-02-06 18:01:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 325 states have (on average 1.396923076923077) internal successors, (454), 335 states have internal predecessors, (454), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 521 transitions. [2025-02-06 18:01:25,671 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 521 transitions. Word has length 22 [2025-02-06 18:01:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:25,671 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 521 transitions. [2025-02-06 18:01:25,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:25,674 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 521 transitions. [2025-02-06 18:01:25,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 18:01:25,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:25,675 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:25,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:01:25,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:25,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 536348519, now seen corresponding path program 1 times [2025-02-06 18:01:25,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:25,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927600435] [2025-02-06 18:01:25,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:25,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:26,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 18:01:26,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 18:01:26,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:26,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:26,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927600435] [2025-02-06 18:01:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927600435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:26,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:26,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:01:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867182476] [2025-02-06 18:01:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:26,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:26,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:26,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:26,453 INFO L87 Difference]: Start difference. First operand 380 states and 521 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:26,492 INFO L93 Difference]: Finished difference Result 743 states and 1026 transitions. [2025-02-06 18:01:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:26,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-06 18:01:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:26,494 INFO L225 Difference]: With dead ends: 743 [2025-02-06 18:01:26,494 INFO L226 Difference]: Without dead ends: 383 [2025-02-06 18:01:26,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:26,496 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 2 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1003 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:26,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1003 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-06 18:01:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2025-02-06 18:01:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 328 states have (on average 1.3932926829268293) internal successors, (457), 338 states have internal predecessors, (457), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 524 transitions. [2025-02-06 18:01:26,507 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 524 transitions. Word has length 27 [2025-02-06 18:01:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:26,507 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 524 transitions. [2025-02-06 18:01:26,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 524 transitions. [2025-02-06 18:01:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:01:26,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:26,508 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:26,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:01:26,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:26,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1085875853, now seen corresponding path program 1 times [2025-02-06 18:01:26,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:26,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738291248] [2025-02-06 18:01:26,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:26,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:27,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:01:27,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:01:27,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:27,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 18:01:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738291248] [2025-02-06 18:01:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738291248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184053704] [2025-02-06 18:01:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:27,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:27,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:27,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:27,329 INFO L87 Difference]: Start difference. First operand 383 states and 524 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:27,472 INFO L93 Difference]: Finished difference Result 396 states and 539 transitions. [2025-02-06 18:01:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:27,473 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 30 [2025-02-06 18:01:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:27,477 INFO L225 Difference]: With dead ends: 396 [2025-02-06 18:01:27,477 INFO L226 Difference]: Without dead ends: 394 [2025-02-06 18:01:27,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:27,478 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 3 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:27,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1000 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:27,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-06 18:01:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2025-02-06 18:01:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 337 states have (on average 1.3946587537091988) internal successors, (470), 347 states have internal predecessors, (470), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 537 transitions. [2025-02-06 18:01:27,506 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 537 transitions. Word has length 30 [2025-02-06 18:01:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:27,507 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 537 transitions. [2025-02-06 18:01:27,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 537 transitions. [2025-02-06 18:01:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:01:27,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:27,508 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:27,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:01:27,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:27,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1085876013, now seen corresponding path program 1 times [2025-02-06 18:01:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:27,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214134257] [2025-02-06 18:01:27,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:28,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:01:28,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:01:28,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:28,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:01:28,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214134257] [2025-02-06 18:01:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214134257] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:28,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765302610] [2025-02-06 18:01:28,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:28,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:28,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:28,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:28,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:01:29,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:01:29,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:01:29,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:29,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:29,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:01:29,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:01:30,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:01:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765302610] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:30,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:30,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:01:30,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792246108] [2025-02-06 18:01:30,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:30,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:01:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:30,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:01:30,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:01:30,339 INFO L87 Difference]: Start difference. First operand 392 states and 537 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 18:01:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:30,509 INFO L93 Difference]: Finished difference Result 786 states and 1082 transitions. [2025-02-06 18:01:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:01:30,510 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-02-06 18:01:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:30,512 INFO L225 Difference]: With dead ends: 786 [2025-02-06 18:01:30,512 INFO L226 Difference]: Without dead ends: 409 [2025-02-06 18:01:30,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:01:30,513 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 5 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:30,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2482 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-02-06 18:01:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-02-06 18:01:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 355 states have (on average 1.3690140845070422) internal successors, (486), 364 states have internal predecessors, (486), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 553 transitions. [2025-02-06 18:01:30,526 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 553 transitions. Word has length 30 [2025-02-06 18:01:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:30,528 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 553 transitions. [2025-02-06 18:01:30,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 18:01:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 553 transitions. [2025-02-06 18:01:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:01:30,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:30,529 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:30,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:01:30,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 18:01:30,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:30,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:30,731 INFO L85 PathProgramCache]: Analyzing trace with hash 211051145, now seen corresponding path program 1 times [2025-02-06 18:01:30,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:30,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183456095] [2025-02-06 18:01:30,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:30,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:31,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:01:31,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:01:31,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:31,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 18:01:31,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183456095] [2025-02-06 18:01:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183456095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:31,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:31,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:31,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831474516] [2025-02-06 18:01:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:31,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:31,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:31,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:31,304 INFO L87 Difference]: Start difference. First operand 409 states and 553 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:31,332 INFO L93 Difference]: Finished difference Result 409 states and 553 transitions. [2025-02-06 18:01:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-06 18:01:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:31,334 INFO L225 Difference]: With dead ends: 409 [2025-02-06 18:01:31,334 INFO L226 Difference]: Without dead ends: 408 [2025-02-06 18:01:31,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:31,335 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:31,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1001 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-06 18:01:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 404. [2025-02-06 18:01:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 351 states have (on average 1.3675213675213675) internal successors, (480), 359 states have internal predecessors, (480), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 547 transitions. [2025-02-06 18:01:31,345 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 547 transitions. Word has length 49 [2025-02-06 18:01:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:31,345 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 547 transitions. [2025-02-06 18:01:31,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 547 transitions. [2025-02-06 18:01:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:01:31,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:31,346 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:31,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:01:31,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:31,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1292934903, now seen corresponding path program 1 times [2025-02-06 18:01:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:31,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546003999] [2025-02-06 18:01:31,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:31,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:31,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:01:31,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:01:31,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:31,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:31,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546003999] [2025-02-06 18:01:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546003999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:01:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51817937] [2025-02-06 18:01:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:31,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:01:31,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:31,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:01:31,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:31,919 INFO L87 Difference]: Start difference. First operand 404 states and 547 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:31,981 INFO L93 Difference]: Finished difference Result 409 states and 552 transitions. [2025-02-06 18:01:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:01:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-06 18:01:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:31,984 INFO L225 Difference]: With dead ends: 409 [2025-02-06 18:01:31,984 INFO L226 Difference]: Without dead ends: 407 [2025-02-06 18:01:31,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:01:31,985 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:31,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1000 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-06 18:01:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-02-06 18:01:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 362 states have internal predecessors, (483), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 550 transitions. [2025-02-06 18:01:32,000 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 550 transitions. Word has length 49 [2025-02-06 18:01:32,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:32,000 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 550 transitions. [2025-02-06 18:01:32,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 550 transitions. [2025-02-06 18:01:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 18:01:32,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:32,003 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] [2025-02-06 18:01:32,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:01:32,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:32,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:32,004 INFO L85 PathProgramCache]: Analyzing trace with hash -556488119, now seen corresponding path program 1 times [2025-02-06 18:01:32,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:32,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771778931] [2025-02-06 18:01:32,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:32,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 18:01:32,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 18:01:32,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:32,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:32,629 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-06 18:01:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771778931] [2025-02-06 18:01:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771778931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360952924] [2025-02-06 18:01:32,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:32,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:32,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:32,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:32,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:01:33,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 18:01:33,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 18:01:33,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:33,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:33,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:01:33,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:33,739 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-06 18:01:33,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360952924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:33,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:33,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-02-06 18:01:33,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087032554] [2025-02-06 18:01:33,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:33,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:01:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:33,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:01:33,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:33,741 INFO L87 Difference]: Start difference. First operand 407 states and 550 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:33,789 INFO L93 Difference]: Finished difference Result 418 states and 562 transitions. [2025-02-06 18:01:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:01:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 52 [2025-02-06 18:01:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:33,792 INFO L225 Difference]: With dead ends: 418 [2025-02-06 18:01:33,792 INFO L226 Difference]: Without dead ends: 409 [2025-02-06 18:01:33,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:33,793 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 0 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:33,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1503 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:01:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-02-06 18:01:33,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-02-06 18:01:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 356 states have (on average 1.3623595505617978) internal successors, (485), 364 states have internal predecessors, (485), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 552 transitions. [2025-02-06 18:01:33,803 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 552 transitions. Word has length 52 [2025-02-06 18:01:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:33,803 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 552 transitions. [2025-02-06 18:01:33,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 552 transitions. [2025-02-06 18:01:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 18:01:33,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:33,804 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:33,815 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-06 18:01:34,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 18:01:34,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:34,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:34,005 INFO L85 PathProgramCache]: Analyzing trace with hash -752294369, now seen corresponding path program 1 times [2025-02-06 18:01:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:34,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079188496] [2025-02-06 18:01:34,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:34,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:34,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:01:34,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:01:34,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:34,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:34,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079188496] [2025-02-06 18:01:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079188496] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99598517] [2025-02-06 18:01:34,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:34,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:34,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:34,838 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:34,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:01:35,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:01:35,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:01:35,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:35,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:35,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 2127 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:01:35,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:35,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:36,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99598517] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:36,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:36,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:01:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887289945] [2025-02-06 18:01:36,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:36,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:01:36,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:36,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:01:36,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:36,068 INFO L87 Difference]: Start difference. First operand 409 states and 552 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:36,173 INFO L93 Difference]: Finished difference Result 793 states and 1081 transitions. [2025-02-06 18:01:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-06 18:01:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:36,176 INFO L225 Difference]: With dead ends: 793 [2025-02-06 18:01:36,176 INFO L226 Difference]: Without dead ends: 427 [2025-02-06 18:01:36,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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-06 18:01:36,177 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 4 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:36,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1999 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-06 18:01:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-02-06 18:01:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 382 states have internal predecessors, (503), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:01:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 570 transitions. [2025-02-06 18:01:36,187 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 570 transitions. Word has length 55 [2025-02-06 18:01:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:36,187 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 570 transitions. [2025-02-06 18:01:36,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 570 transitions. [2025-02-06 18:01:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 18:01:36,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:36,188 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, 1, 1] [2025-02-06 18:01:36,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:01:36,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 18:01:36,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:36,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1281815650, now seen corresponding path program 1 times [2025-02-06 18:01:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:36,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605805315] [2025-02-06 18:01:36,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:36,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 18:01:36,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 18:01:36,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:36,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:37,171 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-06 18:01:37,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:37,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605805315] [2025-02-06 18:01:37,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605805315] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:37,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231200636] [2025-02-06 18:01:37,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:37,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:37,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:37,173 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:37,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:01:38,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 18:01:38,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 18:01:38,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:38,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:38,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:01:38,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 18:01:38,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:01:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231200636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:38,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:01:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-02-06 18:01:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353394749] [2025-02-06 18:01:38,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:38,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:01:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:38,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:01:38,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:38,408 INFO L87 Difference]: Start difference. First operand 427 states and 570 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:38,506 INFO L93 Difference]: Finished difference Result 547 states and 745 transitions. [2025-02-06 18:01:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:01:38,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 56 [2025-02-06 18:01:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:38,508 INFO L225 Difference]: With dead ends: 547 [2025-02-06 18:01:38,508 INFO L226 Difference]: Without dead ends: 534 [2025-02-06 18:01:38,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:01:38,509 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 140 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:38,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1634 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-06 18:01:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 531. [2025-02-06 18:01:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 467 states have (on average 1.3618843683083512) internal successors, (636), 477 states have internal predecessors, (636), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-06 18:01:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 724 transitions. [2025-02-06 18:01:38,521 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 724 transitions. Word has length 56 [2025-02-06 18:01:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:38,521 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 724 transitions. [2025-02-06 18:01:38,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 724 transitions. [2025-02-06 18:01:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 18:01:38,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:38,522 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:38,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 18:01:38,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:38,726 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:38,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1927398122, now seen corresponding path program 1 times [2025-02-06 18:01:38,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:38,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26033796] [2025-02-06 18:01:38,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:38,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:39,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 18:01:39,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 18:01:39,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:39,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:39,355 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:39,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:39,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26033796] [2025-02-06 18:01:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26033796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:39,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:39,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:01:39,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577768456] [2025-02-06 18:01:39,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:39,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:01:39,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:39,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:01:39,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:39,357 INFO L87 Difference]: Start difference. First operand 531 states and 724 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:39,464 INFO L93 Difference]: Finished difference Result 549 states and 741 transitions. [2025-02-06 18:01:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:39,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2025-02-06 18:01:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:39,467 INFO L225 Difference]: With dead ends: 549 [2025-02-06 18:01:39,467 INFO L226 Difference]: Without dead ends: 545 [2025-02-06 18:01:39,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:01:39,468 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 19 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:39,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2492 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:01:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-06 18:01:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 541. [2025-02-06 18:01:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 474 states have (on average 1.358649789029536) internal successors, (644), 484 states have internal predecessors, (644), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-06 18:01:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 734 transitions. [2025-02-06 18:01:39,482 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 734 transitions. Word has length 59 [2025-02-06 18:01:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:39,482 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 734 transitions. [2025-02-06 18:01:39,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 734 transitions. [2025-02-06 18:01:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 18:01:39,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:39,482 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:39,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:01:39,483 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:39,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1927368331, now seen corresponding path program 1 times [2025-02-06 18:01:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793668717] [2025-02-06 18:01:39,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:39,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 18:01:40,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 18:01:40,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:40,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:01:40,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:40,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793668717] [2025-02-06 18:01:40,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793668717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:01:40,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:01:40,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:01:40,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692794362] [2025-02-06 18:01:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:01:40,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:01:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:40,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:01:40,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:40,360 INFO L87 Difference]: Start difference. First operand 541 states and 734 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:40,541 INFO L93 Difference]: Finished difference Result 787 states and 1062 transitions. [2025-02-06 18:01:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:01:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2025-02-06 18:01:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:40,543 INFO L225 Difference]: With dead ends: 787 [2025-02-06 18:01:40,543 INFO L226 Difference]: Without dead ends: 437 [2025-02-06 18:01:40,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:01:40,545 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 164 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:40,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 2278 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:01:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-06 18:01:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-02-06 18:01:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 381 states have (on average 1.3385826771653544) internal successors, (510), 389 states have internal predecessors, (510), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 18:01:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 579 transitions. [2025-02-06 18:01:40,558 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 579 transitions. Word has length 59 [2025-02-06 18:01:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:40,558 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 579 transitions. [2025-02-06 18:01:40,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 579 transitions. [2025-02-06 18:01:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 18:01:40,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:40,559 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:40,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:01:40,559 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:40,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash -339250150, now seen corresponding path program 1 times [2025-02-06 18:01:40,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971457029] [2025-02-06 18:01:40,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:40,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:41,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 18:01:41,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 18:01:41,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:41,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 18:01:41,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:01:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971457029] [2025-02-06 18:01:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971457029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:01:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668714778] [2025-02-06 18:01:41,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:41,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:41,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:41,343 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:41,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 18:01:42,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 18:01:42,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 18:01:42,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:42,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:01:42,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:01:42,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:01:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:43,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:01:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:01:43,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668714778] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:01:43,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:01:43,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:01:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460586885] [2025-02-06 18:01:43,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:01:43,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:01:43,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:01:43,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:01:43,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:01:43,300 INFO L87 Difference]: Start difference. First operand 437 states and 579 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:01:43,566 INFO L93 Difference]: Finished difference Result 857 states and 1151 transitions. [2025-02-06 18:01:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:01:43,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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 72 [2025-02-06 18:01:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:01:43,570 INFO L225 Difference]: With dead ends: 857 [2025-02-06 18:01:43,570 INFO L226 Difference]: Without dead ends: 472 [2025-02-06 18:01:43,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 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-06 18:01:43,572 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 5 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:01:43,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2475 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:01:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-02-06 18:01:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-02-06 18:01:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 417 states have (on average 1.3069544364508394) internal successors, (545), 424 states have internal predecessors, (545), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 18:01:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 614 transitions. [2025-02-06 18:01:43,588 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 614 transitions. Word has length 72 [2025-02-06 18:01:43,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:01:43,588 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 614 transitions. [2025-02-06 18:01:43,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:01:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 614 transitions. [2025-02-06 18:01:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 18:01:43,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:43,593 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:43,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 18:01:43,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 18:01:43,797 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:43,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:43,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1108343165, now seen corresponding path program 1 times [2025-02-06 18:01:43,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:01:43,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882386992] [2025-02-06 18:01:43,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:43,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:01:44,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 18:01:44,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 18:01:44,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:44,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:01:44,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:01:44,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 18:01:45,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 18:01:45,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:01:45,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:01:45,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:01:45,183 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:01:45,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE (51 of 52 remaining) [2025-02-06 18:01:45,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2025-02-06 18:01:45,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2025-02-06 18:01:45,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2025-02-06 18:01:45,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2025-02-06 18:01:45,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2025-02-06 18:01:45,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2025-02-06 18:01:45,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2025-02-06 18:01:45,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2025-02-06 18:01:45,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (42 of 52 remaining) [2025-02-06 18:01:45,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2025-02-06 18:01:45,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2025-02-06 18:01:45,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2025-02-06 18:01:45,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2025-02-06 18:01:45,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2025-02-06 18:01:45,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2025-02-06 18:01:45,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2025-02-06 18:01:45,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2025-02-06 18:01:45,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2025-02-06 18:01:45,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2025-02-06 18:01:45,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2025-02-06 18:01:45,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2025-02-06 18:01:45,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2025-02-06 18:01:45,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:01:45,196 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:01:45,369 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 18:01:45,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 06:01:45 BoogieIcfgContainer [2025-02-06 18:01:45,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 18:01:45,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 18:01:45,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 18:01:45,373 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 18:01:45,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:13" (3/4) ... [2025-02-06 18:01:45,376 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 18:01:45,377 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 18:01:45,377 INFO L158 Benchmark]: Toolchain (without parser) took 39679.27ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 110.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2025-02-06 18:01:45,377 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:01:45,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1309.42ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 57.9MB in the end (delta: 52.7MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-02-06 18:01:45,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 172.79ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 96.6MB in the end (delta: -38.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2025-02-06 18:01:45,378 INFO L158 Benchmark]: Boogie Preprocessor took 199.74ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 84.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:01:45,378 INFO L158 Benchmark]: IcfgBuilder took 6194.93ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.0MB in the beginning and 210.4MB in the end (delta: -126.4MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. [2025-02-06 18:01:45,378 INFO L158 Benchmark]: TraceAbstraction took 31790.27ms. Allocated memory was 427.8MB in the beginning and 1.8GB in the end (delta: 1.3GB). Free memory was 210.4MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 897.7MB. Max. memory is 16.1GB. [2025-02-06 18:01:45,379 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 1.8GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 155.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:01:45,380 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1309.42ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 57.9MB in the end (delta: 52.7MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 172.79ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 96.6MB in the end (delta: -38.7MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 199.74ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 84.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 6194.93ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.0MB in the beginning and 210.4MB in the end (delta: -126.4MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31790.27ms. Allocated memory was 427.8MB in the beginning and 1.8GB in the end (delta: 1.3GB). Free memory was 210.4MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 897.7MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 1.8GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 155.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1135]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of undefined function vasprintf at line 1135. Possible FailurePath: [L2370] static const char *applet_name; [L2371] static signed int bb_errno_location; [L2372] static signed int * const bb_errno = &bb_errno_location; [L2373] static const char bb_msg_memory_exhausted[14l] = { (const char)111, (const char)117, (const char)116, (const char)32, (const char)111, (const char)102, (const char)32, (const char)109, (const char)101, (const char)109, (const char)111, (const char)114, (const char)121, (const char)0 }; [L2374] static struct __jmp_buf_tag die_jmp[1l]; [L2375] static signed int die_sleep; [L2376] static char local_buf[(signed long int)(sizeof(signed int) * 3) ]; [L2377] static signed char logmode = (signed char)1; [L2378] static const char *msg_eol = "\n"; [L2379] static unsigned char xfunc_error_retval = (unsigned char)1; [L2445] static const char charmap[20l] = { (const char)97, (const char)98, (const char)101, (const char)102, (const char)110, (const char)114, (const char)116, (const char)118, (const char)92, (const char)0, (const char)7, (const char)8, (const char)27, (const char)12, (const char)10, (const char)13, (const char)9, (const char)11, (const char)92, (const char)92 }; [L3133] static const char format_chars[14l] = { (const char)100, (const char)105, (const char)111, (const char)117, (const char)120, (const char)88, (const char)102, (const char)101, (const char)69, (const char)103, (const char)71, (const char)99, (const char)115, (const char)0 }; [L3336] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3399] char *a = malloc(11); [L3400] a[10] = 0 [L3401] int i=0; VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=0, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=0, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=1, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=1, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=2, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=2, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=3, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=3, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=4, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=4, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=5, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=5, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=6, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=6, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=7, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=7, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=8, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=8, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=9, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=9, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=10, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND FALSE !(i<10) [L3403] applet_name = a [L3404] bb_errno_location = __VERIFIER_nondet_int() [L3405] optind = 1 [L3406] int argc = __VERIFIER_nondet_int(); [L3407] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={331:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={331:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L3407] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={331:0}, argc=1, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L3408] EXPR argc+1 [L3408] char **argv=malloc((argc+1)*sizeof(char*)); [L3409] EXPR argc+1 [L3409] char **mem_track=malloc((argc+1)*sizeof(char*)); [L3410] argv[argc]=0 [L3411] int i=0; VAL [applet_name={331:0}, argc=1, argv={-12:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=0, local_buf={14:0}, logmode=1, mem_track={-13:0}, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L3411] COND TRUE i 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 -> 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a [2025-02-06 18:01:48,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:01:48,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:01:48,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:01:48,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:01:48,526 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:01:48,527 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-1.i [2025-02-06 18:01:49,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e39370410/e721b850ded948b0b25e98940590433c/FLAG090ead44a [2025-02-06 18:01:50,318 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:01:50,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-02-06 18:01:50,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e39370410/e721b850ded948b0b25e98940590433c/FLAG090ead44a [2025-02-06 18:01:50,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e39370410/e721b850ded948b0b25e98940590433c [2025-02-06 18:01:50,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:01:50,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:01:50,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:50,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:01:50,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:01:50,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:50" (1/1) ... [2025-02-06 18:01:50,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37af77ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:50, skipping insertion in model container [2025-02-06 18:01:50,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:01:50" (1/1) ... [2025-02-06 18:01:50,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:01:51,326 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,327 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,339 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,342 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,344 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,346 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,347 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,348 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,349 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,349 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,350 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,350 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,351 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,353 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,354 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,355 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,356 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,357 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,357 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,358 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,358 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,359 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,359 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,361 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,361 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,361 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,365 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,373 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,374 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,375 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,379 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,381 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,382 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,383 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,385 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,387 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,388 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,390 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,392 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,395 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,395 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,396 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,396 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,396 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,397 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,402 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,403 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,404 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,406 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,409 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,411 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,412 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,412 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,413 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,413 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,414 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,421 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,423 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,424 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,430 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,441 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 18:01:51,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:51,480 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:01:51,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:01:51,868 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 18:01:51,876 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:01:51,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51 WrapperNode [2025-02-06 18:01:51,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:01:51,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:51,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:01:51,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:01:51,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:51,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,001 INFO L138 Inliner]: procedures = 663, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1811 [2025-02-06 18:01:52,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:01:52,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:01:52,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:01:52,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:01:52,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,047 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 18:01:52,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:01:52,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:01:52,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:01:52,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:01:52,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (1/1) ... [2025-02-06 18:01:52,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:01:52,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:52,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:01:52,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:01:52,211 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-02-06 18:01:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-02-06 18:01:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 18:01:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-02-06 18:01:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:01:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 18:01:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 18:01:52,212 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 18:01:52,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-02-06 18:01:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-02-06 18:01:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 18:01:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-02-06 18:01:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intFLOATTYPE8 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-02-06 18:01:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-02-06 18:01:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-02-06 18:01:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-02-06 18:01:52,213 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-02-06 18:01:52,213 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-02-06 18:01:52,667 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:01:52,669 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:01:52,764 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-02-06 18:01:53,060 INFO L1309 $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; [2025-02-06 18:01:53,108 INFO L1309 $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-06 18:01:53,348 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem159#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-06 18:01:53,348 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-02-06 18:01:53,348 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem161#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-06 18:01:53,348 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem163#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-06 18:01:59,426 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem307#1;havoc __main_#t~short308#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-06 18:01:59,426 INFO L1309 $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; [2025-02-06 18:01:59,426 INFO L1309 $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-06 18:01:59,553 INFO L? ?]: Removed 608 outVars from TransFormulas that were not future-live. [2025-02-06 18:01:59,554 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:01:59,579 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:01:59,583 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:01:59,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:59 BoogieIcfgContainer [2025-02-06 18:01:59,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:01:59,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:01:59,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:01:59,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:01:59,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:01:50" (1/3) ... [2025-02-06 18:01:59,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b12d793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:59, skipping insertion in model container [2025-02-06 18:01:59,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:01:51" (2/3) ... [2025-02-06 18:01:59,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b12d793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:01:59, skipping insertion in model container [2025-02-06 18:01:59,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:01:59" (3/3) ... [2025-02-06 18:01:59,596 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-1.i [2025-02-06 18:01:59,609 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:01:59,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-1.i that has 15 procedures, 493 locations, 1 initial locations, 23 loop locations, and 52 error locations. [2025-02-06 18:01:59,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:01:59,678 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;@493e7d95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:01:59,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-06 18:01:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 493 states, 374 states have (on average 1.5802139037433156) internal successors, (591), 441 states have internal predecessors, (591), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 18:01:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 18:01:59,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:01:59,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 18:01:59,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:01:59,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:01:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 23918143, now seen corresponding path program 1 times [2025-02-06 18:01:59,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:01:59,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375198421] [2025-02-06 18:01:59,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:01:59,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:01:59,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:01:59,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:01:59,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:02:00,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:02:01,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:02:01,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:01,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:01,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 18:02:01,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:02:01,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:01,180 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:02:01,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375198421] [2025-02-06 18:02:01,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375198421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:01,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:01,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:02:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105781505] [2025-02-06 18:02:01,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:01,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:02:01,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:02:01,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:02:01,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:02:01,225 INFO L87 Difference]: Start difference. First operand has 493 states, 374 states have (on average 1.5802139037433156) internal successors, (591), 441 states have internal predecessors, (591), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:02:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:01,292 INFO L93 Difference]: Finished difference Result 860 states and 1275 transitions. [2025-02-06 18:02:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:02:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 18:02:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:01,303 INFO L225 Difference]: With dead ends: 860 [2025-02-06 18:02:01,303 INFO L226 Difference]: Without dead ends: 355 [2025-02-06 18:02:01,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:02:01,311 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:01,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:02:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-06 18:02:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-02-06 18:02:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 302 states have (on average 1.400662251655629) internal successors, (423), 310 states have internal predecessors, (423), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:02:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 490 transitions. [2025-02-06 18:02:01,364 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 490 transitions. Word has length 4 [2025-02-06 18:02:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:01,364 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 490 transitions. [2025-02-06 18:02:01,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:02:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 490 transitions. [2025-02-06 18:02:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 18:02:01,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:01,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:02:01,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 18:02:01,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:01,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:02:01,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash 741463144, now seen corresponding path program 1 times [2025-02-06 18:02:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:02:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [511577718] [2025-02-06 18:02:01,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:01,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:01,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:01,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:01,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:02:02,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:02:02,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:02:02,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:02,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:02,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:02:02,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:02:03,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:03,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:02:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511577718] [2025-02-06 18:02:03,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511577718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:03,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:03,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:02:03,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622478001] [2025-02-06 18:02:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:03,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:02:03,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:02:03,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:02:03,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:03,217 INFO L87 Difference]: Start difference. First operand 355 states and 490 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:02:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:03,559 INFO L93 Difference]: Finished difference Result 708 states and 978 transitions. [2025-02-06 18:02:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-06 18:02:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:03,563 INFO L225 Difference]: With dead ends: 708 [2025-02-06 18:02:03,563 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 18:02:03,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:03,564 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:03,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 971 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:02:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 18:02:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-06 18:02:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 305 states have (on average 1.3967213114754098) internal successors, (426), 313 states have internal predecessors, (426), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:02:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 493 transitions. [2025-02-06 18:02:03,590 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 493 transitions. Word has length 5 [2025-02-06 18:02:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:03,592 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 493 transitions. [2025-02-06 18:02:03,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:02:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 493 transitions. [2025-02-06 18:02:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:02:03,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:03,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:02:03,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:02:03,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:03,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:02:03,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash -87570495, now seen corresponding path program 1 times [2025-02-06 18:02:03,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:02:03,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311459623] [2025-02-06 18:02:03,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:03,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:03,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:03,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:03,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:02:04,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:02:04,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:02:04,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:04,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:04,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:02:04,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:02:05,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:02:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:02:06,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:02:06,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311459623] [2025-02-06 18:02:06,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311459623] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:02:06,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 18:02:06,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-06 18:02:06,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628494814] [2025-02-06 18:02:06,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 18:02:06,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:02:06,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:02:06,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:02:06,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:02:06,750 INFO L87 Difference]: Start difference. First operand 358 states and 493 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:02:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:07,874 INFO L93 Difference]: Finished difference Result 711 states and 983 transitions. [2025-02-06 18:02:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:02:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 18:02:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:07,877 INFO L225 Difference]: With dead ends: 711 [2025-02-06 18:02:07,877 INFO L226 Difference]: Without dead ends: 361 [2025-02-06 18:02:07,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:02:07,879 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:07,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1937 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 18:02:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-06 18:02:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 358. [2025-02-06 18:02:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 306 states have (on average 1.392156862745098) internal successors, (426), 313 states have internal predecessors, (426), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:02:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 493 transitions. [2025-02-06 18:02:07,898 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 493 transitions. Word has length 8 [2025-02-06 18:02:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:07,898 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 493 transitions. [2025-02-06 18:02:07,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:02:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 493 transitions. [2025-02-06 18:02:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 18:02:07,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:07,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:07,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:02:08,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:08,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:02:08,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash 443017089, now seen corresponding path program 1 times [2025-02-06 18:02:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:02:08,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200617420] [2025-02-06 18:02:08,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:08,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:08,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:08,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:08,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:02:08,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 18:02:09,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:02:09,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:09,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:09,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:02:09,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:02:10,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:10,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:02:10,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200617420] [2025-02-06 18:02:10,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200617420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:10,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:10,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:02:10,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107688884] [2025-02-06 18:02:10,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:10,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:02:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:02:10,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:02:10,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:02:10,301 INFO L87 Difference]: Start difference. First operand 358 states and 493 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:11,987 INFO L93 Difference]: Finished difference Result 358 states and 493 transitions. [2025-02-06 18:02:11,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:02:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-06 18:02:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:11,995 INFO L225 Difference]: With dead ends: 358 [2025-02-06 18:02:11,995 INFO L226 Difference]: Without dead ends: 356 [2025-02-06 18:02:11,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:02:11,996 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 148 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:11,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1747 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 18:02:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-06 18:02:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-02-06 18:02:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 306 states have (on average 1.3856209150326797) internal successors, (424), 311 states have internal predecessors, (424), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:02:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 491 transitions. [2025-02-06 18:02:12,019 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 491 transitions. Word has length 16 [2025-02-06 18:02:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:12,020 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 491 transitions. [2025-02-06 18:02:12,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 491 transitions. [2025-02-06 18:02:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:02:12,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:12,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:12,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 18:02:12,225 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 [2025-02-06 18:02:12,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:02:12,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1340050665, now seen corresponding path program 1 times [2025-02-06 18:02:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:02:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989576065] [2025-02-06 18:02:12,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:12,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:12,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:12,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:02:12,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:02:13,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:02:13,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:13,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:13,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:02:13,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:02:13,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:13,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:02:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989576065] [2025-02-06 18:02:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989576065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:02:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543494656] [2025-02-06 18:02:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:13,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:02:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:02:13,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:02:13,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:13,727 INFO L87 Difference]: Start difference. First operand 356 states and 491 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:14,438 INFO L93 Difference]: Finished difference Result 364 states and 501 transitions. [2025-02-06 18:02:14,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:14,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 18:02:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:14,440 INFO L225 Difference]: With dead ends: 364 [2025-02-06 18:02:14,440 INFO L226 Difference]: Without dead ends: 363 [2025-02-06 18:02:14,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:14,442 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 4 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:14,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 961 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 18:02:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-06 18:02:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 362. [2025-02-06 18:02:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 312 states have (on average 1.3878205128205128) internal successors, (433), 317 states have internal predecessors, (433), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:02:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 500 transitions. [2025-02-06 18:02:14,453 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 500 transitions. Word has length 22 [2025-02-06 18:02:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:14,454 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 500 transitions. [2025-02-06 18:02:14,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 500 transitions. [2025-02-06 18:02:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:02:14,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:14,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:14,496 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-06 18:02:14,655 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 [2025-02-06 18:02:14,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:02:14,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1340045700, now seen corresponding path program 1 times [2025-02-06 18:02:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:02:14,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009358362] [2025-02-06 18:02:14,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:14,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:14,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:14,663 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:14,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:02:15,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:02:15,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:02:15,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:15,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:15,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:02:15,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:02:16,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:16,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:02:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009358362] [2025-02-06 18:02:16,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009358362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:16,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:16,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:02:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508177065] [2025-02-06 18:02:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:16,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:02:16,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:02:16,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:02:16,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:16,088 INFO L87 Difference]: Start difference. First operand 362 states and 500 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:16,398 INFO L93 Difference]: Finished difference Result 712 states and 987 transitions. [2025-02-06 18:02:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:16,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-06 18:02:16,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:16,400 INFO L225 Difference]: With dead ends: 712 [2025-02-06 18:02:16,401 INFO L226 Difference]: Without dead ends: 368 [2025-02-06 18:02:16,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:16,403 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 964 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:16,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 964 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:02:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-06 18:02:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-02-06 18:02:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 318 states have (on average 1.380503144654088) internal successors, (439), 323 states have internal predecessors, (439), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:02:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 506 transitions. [2025-02-06 18:02:16,419 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 506 transitions. Word has length 22 [2025-02-06 18:02:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:16,419 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 506 transitions. [2025-02-06 18:02:16,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 506 transitions. [2025-02-06 18:02:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 18:02:16,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:16,420 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:16,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:02:16,625 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 [2025-02-06 18:02:16,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:02:16,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:16,628 INFO L85 PathProgramCache]: Analyzing trace with hash 420261661, now seen corresponding path program 1 times [2025-02-06 18:02:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:02:16,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492859985] [2025-02-06 18:02:16,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:16,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:16,631 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:16,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:02:17,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 18:02:17,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 18:02:17,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:17,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:17,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:02:17,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:18,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:02:18,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:02:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:02:19,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:02:19,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492859985] [2025-02-06 18:02:19,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492859985] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:02:19,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 18:02:19,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-02-06 18:02:19,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585706876] [2025-02-06 18:02:19,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 18:02:19,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:02:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:02:19,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:02:19,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:02:19,461 INFO L87 Difference]: Start difference. First operand 368 states and 506 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:20,497 INFO L93 Difference]: Finished difference Result 722 states and 1000 transitions. [2025-02-06 18:02:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:02:20,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 25 [2025-02-06 18:02:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:20,500 INFO L225 Difference]: With dead ends: 722 [2025-02-06 18:02:20,500 INFO L226 Difference]: Without dead ends: 375 [2025-02-06 18:02:20,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:02:20,502 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:20,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1922 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 18:02:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-06 18:02:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 369. [2025-02-06 18:02:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 320 states have (on average 1.371875) internal successors, (439), 324 states have internal predecessors, (439), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:02:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 506 transitions. [2025-02-06 18:02:20,522 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 506 transitions. Word has length 25 [2025-02-06 18:02:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:20,522 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 506 transitions. [2025-02-06 18:02:20,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 506 transitions. [2025-02-06 18:02:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 18:02:20,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:20,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:20,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 18:02:20,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:20,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:02:20,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash 764683032, now seen corresponding path program 1 times [2025-02-06 18:02:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:02:20,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565271152] [2025-02-06 18:02:20,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:20,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:20,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:20,730 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:20,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 18:02:21,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 18:02:21,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 18:02:21,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:21,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:21,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:02:21,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:02:22,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:22,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:02:22,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565271152] [2025-02-06 18:02:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565271152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:22,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:22,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:02:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797668653] [2025-02-06 18:02:22,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:22,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:02:22,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:02:22,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:02:22,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:02:22,269 INFO L87 Difference]: Start difference. First operand 369 states and 506 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:22,680 INFO L93 Difference]: Finished difference Result 376 states and 514 transitions. [2025-02-06 18:02:22,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:02:22,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-06 18:02:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:22,682 INFO L225 Difference]: With dead ends: 376 [2025-02-06 18:02:22,682 INFO L226 Difference]: Without dead ends: 371 [2025-02-06 18:02:22,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:02:22,684 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:22,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1446 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:02:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-06 18:02:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-02-06 18:02:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 322 states have (on average 1.3695652173913044) internal successors, (441), 326 states have internal predecessors, (441), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:02:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 508 transitions. [2025-02-06 18:02:22,693 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 508 transitions. Word has length 26 [2025-02-06 18:02:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:22,693 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 508 transitions. [2025-02-06 18:02:22,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 508 transitions. [2025-02-06 18:02:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:02:22,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:22,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:22,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 18:02:22,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:22,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:02:22,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1438392015, now seen corresponding path program 1 times [2025-02-06 18:02:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:02:22,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939495042] [2025-02-06 18:02:22,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:22,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:22,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:22,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:22,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 18:02:23,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:02:23,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:02:23,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:23,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:23,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:02:23,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:02:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 18:02:24,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:02:24,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 18:02:24,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939495042] [2025-02-06 18:02:24,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939495042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:02:24,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:02:24,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:02:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238245919] [2025-02-06 18:02:24,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:02:24,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:02:24,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 18:02:24,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:02:24,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:24,269 INFO L87 Difference]: Start difference. First operand 371 states and 508 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:02:24,548 INFO L93 Difference]: Finished difference Result 375 states and 512 transitions. [2025-02-06 18:02:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:02:24,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 30 [2025-02-06 18:02:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:02:24,550 INFO L225 Difference]: With dead ends: 375 [2025-02-06 18:02:24,550 INFO L226 Difference]: Without dead ends: 374 [2025-02-06 18:02:24,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:02:24,551 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 963 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:02:24,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 963 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:02:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-06 18:02:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-02-06 18:02:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 325 states have (on average 1.366153846153846) internal successors, (444), 329 states have internal predecessors, (444), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 18:02:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 511 transitions. [2025-02-06 18:02:24,560 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 511 transitions. Word has length 30 [2025-02-06 18:02:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:02:24,560 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 511 transitions. [2025-02-06 18:02:24,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:02:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 511 transitions. [2025-02-06 18:02:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 18:02:24,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:02:24,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:02:24,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 18:02:24,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:24,762 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-06 18:02:24,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:02:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1837375159, now seen corresponding path program 1 times [2025-02-06 18:02:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 18:02:24,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210347369] [2025-02-06 18:02:24,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:02:24,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:02:24,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:24,766 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:02:24,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 18:02:25,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 18:02:25,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 18:02:25,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:02:25,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:02:25,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:02:25,849 INFO L279 TraceCheckSpWp]: Computing forward predicates...