./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/readlink-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/readlink-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 990b71a8318a9381d9db0e6d81697b685ad4c408107fd3f1c2acfe3caabf2a23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:27:47,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:27:47,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:27:47,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:27:47,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:27:47,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:27:47,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:27:47,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:27:47,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:27:47,949 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:27:47,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:27:47,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:27:47,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:27:47,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:27:47,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:27:47,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:27:47,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:27:47,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:27:47,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:27:47,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:27:47,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:27:47,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:27:47,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:27:47,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:27:47,954 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:27:47,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:27:47,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:27:47,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:27:47,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:27:47,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:27:47,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:27:47,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:27:47,954 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 -> 990b71a8318a9381d9db0e6d81697b685ad4c408107fd3f1c2acfe3caabf2a23 [2025-02-08 13:27:48,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:27:48,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:27:48,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:27:48,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:27:48,292 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:27:48,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/readlink-1.i [2025-02-08 13:27:49,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71a0e9e9/5b0a472c5df148cf86fa3e5b57dc436f/FLAGe41ba975c [2025-02-08 13:27:50,069 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:27:50,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/readlink-1.i [2025-02-08 13:27:50,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71a0e9e9/5b0a472c5df148cf86fa3e5b57dc436f/FLAGe41ba975c [2025-02-08 13:27:50,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71a0e9e9/5b0a472c5df148cf86fa3e5b57dc436f [2025-02-08 13:27:50,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:27:50,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:27:50,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:27:50,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:27:50,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:27:50,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:27:50" (1/1) ... [2025-02-08 13:27:50,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304366dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:50, skipping insertion in model container [2025-02-08 13:27:50,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:27:50" (1/1) ... [2025-02-08 13:27:50,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:27:51,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:27:51,363 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:27:51,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:27:51,653 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:27:51,659 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:27:51,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51 WrapperNode [2025-02-08 13:27:51,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:27:51,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:27:51,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:27:51,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:27:51,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:51,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:51,804 INFO L138 Inliner]: procedures = 575, calls = 732, calls flagged for inlining = 29, calls inlined = 27, statements flattened = 1939 [2025-02-08 13:27:51,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:27:51,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:27:51,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:27:51,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:27:51,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:51,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:51,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:51,913 INFO L175 MemorySlicer]: Split 616 memory accesses to 22 slices as follows [2, 3, 3, 38, 2, 3, 15, 4, 3, 7, 9, 17, 15, 29, 17, 355, 44, 4, 23, 3, 17, 3]. 58 percent of accesses are in the largest equivalence class. The 384 initializations are split as follows [2, 0, 3, 9, 0, 3, 0, 4, 0, 0, 1, 0, 0, 2, 4, 355, 0, 0, 0, 0, 1, 0]. The 98 writes are split as follows [0, 0, 0, 0, 1, 0, 3, 0, 0, 7, 4, 17, 1, 19, 4, 0, 12, 4, 11, 0, 15, 0]. [2025-02-08 13:27:51,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:51,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:51,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:52,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:52,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:52,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:52,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:27:52,114 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:27:52,114 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:27:52,114 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:27:52,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (1/1) ... [2025-02-08 13:27:52,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:27:52,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:52,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:27:52,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:27:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-08 13:27:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-08 13:27:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-08 13:27:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-08 13:27:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-08 13:27:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-08 13:27:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-08 13:27:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-08 13:27:52,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-08 13:27:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-08 13:27:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-08 13:27:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-08 13:27:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-08 13:27:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-08 13:27:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-08 13:27:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-08 13:27:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-08 13:27:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-08 13:27:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-08 13:27:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-02-08 13:27:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-02-08 13:27:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#21 [2025-02-08 13:27:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-08 13:27:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-08 13:27:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-08 13:27:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-08 13:27:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-08 13:27:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-08 13:27:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-08 13:27:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-08 13:27:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-08 13:27:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-08 13:27:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-08 13:27:52,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-08 13:27:52,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-08 13:27:52,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-08 13:27:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-08 13:27:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-08 13:27:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-08 13:27:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-08 13:27:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-08 13:27:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-02-08 13:27:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-02-08 13:27:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#21 [2025-02-08 13:27:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:27:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-08 13:27:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-08 13:27:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-08 13:27:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-08 13:27:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-08 13:27:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-08 13:27:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-08 13:27:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:27:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 13:27:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 13:27:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 13:27:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 13:27:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 13:27:52,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-08 13:27:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:27:52,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:27:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:27:52,194 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:27:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:27:52,195 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 13:27:52,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-08 13:27:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-02-08 13:27:52,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-02-08 13:27:52,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:27:52,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:27:52,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:27:52,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 13:27:52,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-02-08 13:27:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:27:52,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:27:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:27:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:27:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:27:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:27:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 13:27:52,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 13:27:52,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 13:27:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 13:27:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 13:27:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 13:27:52,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 13:27:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 13:27:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 13:27:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 13:27:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 13:27:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 13:27:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 13:27:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 13:27:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 13:27:52,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 13:27:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:27:52,209 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 13:27:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-08 13:27:52,821 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:27:52,823 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:27:53,386 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: full_write_#t~ret71#1 := safe_write_#res#1;havoc safe_write_#t~ret194#1, safe_write_#t~mem195#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~1#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret71#1 && full_write_#t~ret71#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret71#1;havoc full_write_#t~ret71#1; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: assume full_write_~cc~0#1 < 0; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2341: #t~ret62#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet68#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret62#1 && #t~ret62#1 <= 2147483647;havoc #t~ret62#1;call #t~mem63#1.base, #t~mem63#1.offset := read~$Pointer$#12(~#msg~0#1.base, ~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, #t~mem63#1.base, #t~mem63#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret71#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2342: #t~ret64#1 := full_write_#res#1;havoc full_write_#t~ret71#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= #t~ret64#1 && #t~ret64#1 <= 9223372036854775807;havoc #t~mem63#1.base, #t~mem63#1.offset;havoc #t~ret64#1; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2823-1: assume 0 != safe_write_~tmp_if_expr$1~1#1 % 256; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2823-1: assume !(0 != safe_write_~tmp_if_expr$1~1#1 % 256); [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2823: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet269#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet269#1;assume -9223372036854775808 <= write_#t~nondet269#1 && write_#t~nondet269#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet269#1;havoc write_#t~nondet269#1; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2823: assume !true; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2832-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:27:53,387 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080: write_#res#1 := write_~ret~1#1; [2025-02-08 13:27:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:27:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2825: safe_write_#t~ret194#1 := write_#res#1;havoc write_#t~nondet269#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret194#1 && safe_write_#t~ret194#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret194#1;havoc safe_write_#t~ret194#1; [2025-02-08 13:27:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret194#1, safe_write_#t~mem195#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~1#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~1#1; [2025-02-08 13:27:53,388 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:27:53,389 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2380: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:27:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2380: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:27:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem195#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~1#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem195#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:27:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~1#1 := 0; [2025-02-08 13:27:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2380-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:27:53,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2380-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:27:59,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2942: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256;call xstrtou_range_sfx_#t~mem214#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem214#1;havoc xstrtou_range_sfx_#t~mem214#1;call write~int#10(0, ~bb_errno~0.base, ~bb_errno~0.offset, 4);assume { :begin_inline_bb_strtoui } true;bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1 := xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~base#1;havoc bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet40#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset := bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset;bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset := bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset;bb_strtoui_~b#1 := bb_strtoui_#in~b#1;havoc bb_strtoui_~v~0#1;bb_strtoui_~v~0#1 := bb_strtoui_#t~nondet40#1;havoc bb_strtoui_#t~nondet40#1; [2025-02-08 13:27:59,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2942: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256); [2025-02-08 13:27:59,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2876: xmalloc_readlink_#t~ret201#1.base, xmalloc_readlink_#t~ret201#1.offset := xrealloc_#res#1.base, xrealloc_#res#1.offset;havoc xrealloc_#t~realloc~res209#1.base, xrealloc_#t~realloc~res209#1.offset, xrealloc_#t~varargs210#1.base, xrealloc_#t~varargs210#1.offset, xrealloc_~ptr#1.base, xrealloc_~ptr#1.offset, xrealloc_~size#1;havoc xrealloc_#in~ptr#1.base, xrealloc_#in~ptr#1.offset, xrealloc_#in~size#1;assume { :end_inline_xrealloc } true;xmalloc_readlink_~return_value_xrealloc$1~0#1.base, xmalloc_readlink_~return_value_xrealloc$1~0#1.offset := xmalloc_readlink_#t~ret201#1.base, xmalloc_readlink_#t~ret201#1.offset;havoc xmalloc_readlink_#t~ret201#1.base, xmalloc_readlink_#t~ret201#1.offset;xmalloc_readlink_~buf~1#1.base, xmalloc_readlink_~buf~1#1.offset := xmalloc_readlink_~return_value_xrealloc$1~0#1.base, xmalloc_readlink_~return_value_xrealloc$1~0#1.offset;havoc xmalloc_readlink_~return_value_readlink$2~0#1;assume { :begin_inline_readlink } true;readlink_#in~path#1.base, readlink_#in~path#1.offset, readlink_#in~buf#1.base, readlink_#in~buf#1.offset, readlink_#in~bufsiz#1 := xmalloc_readlink_~path#1.base, xmalloc_readlink_~path#1.offset, xmalloc_readlink_~buf~1#1.base, xmalloc_readlink_~buf~1#1.offset, xmalloc_readlink_~bufsize~0#1;havoc readlink_#res#1;havoc readlink_#t~mem229#1, readlink_#t~nondet230#1, readlink_#t~nondet231#1, readlink_#t~nondet232#1, readlink_#t~pre233#1, readlink_~i~1#1, readlink_~path#1.base, readlink_~path#1.offset, readlink_~buf#1.base, readlink_~buf#1.offset, readlink_~bufsiz#1, readlink_~len~0#1;readlink_~path#1.base, readlink_~path#1.offset := readlink_#in~path#1.base, readlink_#in~path#1.offset;readlink_~buf#1.base, readlink_~buf#1.offset := readlink_#in~buf#1.base, readlink_#in~buf#1.offset;readlink_~bufsiz#1 := readlink_#in~bufsiz#1;call readlink_#t~mem229#1 := read~int#18(readlink_~path#1.base, readlink_~path#1.offset, 1);havoc readlink_#t~mem229#1;havoc readlink_#t~nondet230#1;assume -2147483648 <= readlink_#t~nondet230#1 && readlink_#t~nondet230#1 <= 2147483647; [2025-02-08 13:27:59,203 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2811: __main_#t~ret190#1.base, __main_#t~ret190#1.offset := xmalloc_readlink_or_warn_#res#1.base, xmalloc_readlink_or_warn_#res#1.offset;havoc xmalloc_readlink_or_warn_#t~ret203#1.base, xmalloc_readlink_or_warn_#t~ret203#1.offset, xmalloc_readlink_or_warn_#t~mem204#1, xmalloc_readlink_or_warn_#t~nondet205#1.base, xmalloc_readlink_or_warn_#t~nondet205#1.offset, xmalloc_readlink_or_warn_#t~nondet206#1, xmalloc_readlink_or_warn_#t~varargs207#1.base, xmalloc_readlink_or_warn_#t~varargs207#1.offset, xmalloc_readlink_or_warn_~errmsg~0#1.base, xmalloc_readlink_or_warn_~errmsg~0#1.offset, xmalloc_readlink_or_warn_~err~0#1, xmalloc_readlink_or_warn_~path#1.base, xmalloc_readlink_or_warn_~path#1.offset, xmalloc_readlink_or_warn_~buf~2#1.base, xmalloc_readlink_or_warn_~buf~2#1.offset;havoc xmalloc_readlink_or_warn_#in~path#1.base, xmalloc_readlink_or_warn_#in~path#1.offset;assume { :end_inline_xmalloc_readlink_or_warn } true;__main_~buf~0#1.base, __main_~buf~0#1.offset := __main_#t~ret190#1.base, __main_#t~ret190#1.offset; [2025-02-08 13:27:59,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2712: assume -1 == getopt32_~c~0#1; [2025-02-08 13:27:59,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2712: assume !(-1 == getopt32_~c~0#1);getopt32_~c~0#1 := getopt32_~c~0#1 % 256;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:27:59,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812: assume __main_~buf~0#1.base == 0 && __main_~buf~0#1.offset == 0;__main_#res#1 := 1; [2025-02-08 13:27:59,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812: assume !(__main_~buf~0#1.base == 0 && __main_~buf~0#1.offset == 0);havoc __main_#t~ret191#1; [2025-02-08 13:27:59,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879: xmalloc_readlink_#t~ret202#1 := readlink_#res#1;havoc readlink_#t~mem229#1, readlink_#t~nondet230#1, readlink_#t~nondet231#1, readlink_#t~nondet232#1, readlink_#t~pre233#1, readlink_~i~1#1, readlink_~path#1.base, readlink_~path#1.offset, readlink_~buf#1.base, readlink_~buf#1.offset, readlink_~bufsiz#1, readlink_~len~0#1;havoc readlink_#in~path#1.base, readlink_#in~path#1.offset, readlink_#in~buf#1.base, readlink_#in~buf#1.offset, readlink_#in~bufsiz#1;assume { :end_inline_readlink } true;assume -9223372036854775808 <= xmalloc_readlink_#t~ret202#1 && xmalloc_readlink_#t~ret202#1 <= 9223372036854775807;xmalloc_readlink_~return_value_readlink$2~0#1 := xmalloc_readlink_#t~ret202#1;havoc xmalloc_readlink_#t~ret202#1;xmalloc_readlink_~readsize~0#1 := (if xmalloc_readlink_~return_value_readlink$2~0#1 % 4294967296 <= 2147483647 then xmalloc_readlink_~return_value_readlink$2~0#1 % 4294967296 else xmalloc_readlink_~return_value_readlink$2~0#1 % 4294967296 - 4294967296); [2025-02-08 13:27:59,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979-1: SUMMARY for call bb_error_msg_and_die(13, 0, xstrtou_range_sfx_#t~varargs225#1.base, xstrtou_range_sfx_#t~varargs225#1.offset); srcloc: null [2025-02-08 13:27:59,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: xstrtou_range_sfx_#t~ret215#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet40#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_#t~ret215#1;havoc xstrtou_range_sfx_#t~ret215#1;call xstrtou_range_sfx_#t~mem216#1.base, xstrtou_range_sfx_#t~mem216#1.offset := read~$Pointer$#19(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:27:59,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979: havoc xstrtou_range_sfx_#t~varargs225#1.base, xstrtou_range_sfx_#t~varargs225#1.offset; [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979-2: call xstrtou_range_sfx_#t~varargs225#1.base, xstrtou_range_sfx_#t~varargs225#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$#9(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs225#1.base, xstrtou_range_sfx_#t~varargs225#1.offset, 8);call write~int#9(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs225#1.base, 8 + xstrtou_range_sfx_#t~varargs225#1.offset, 8);call write~int#9(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs225#1.base, 16 + xstrtou_range_sfx_#t~varargs225#1.offset, 8); [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814: havoc __main_#t~ret191#1;havoc __main_#t~bitwise192#1; [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814-2: havoc __main_#t~bitwise192#1;assume __main_#t~bitwise192#1 % 4294967296 <= __main_~opt~0#1 % 4294967296 && __main_#t~bitwise192#1 % 4294967296 <= 2; [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814-1: [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814-4: assume 0 == __main_~opt~0#1 % 4294967296;__main_#t~bitwise192#1 := 0; [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814-4: assume !(0 == __main_~opt~0#1 % 4294967296); [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814-3: assume 2 == __main_~opt~0#1 % 4294967296;__main_#t~bitwise192#1 := __main_~opt~0#1; [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2814-3: assume !(2 == __main_~opt~0#1 % 4294967296); [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2947: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem216#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem216#1.offset);havoc xstrtou_range_sfx_#t~mem216#1.base, xstrtou_range_sfx_#t~mem216#1.offset;call xstrtou_range_sfx_#t~mem217#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:27:59,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2947: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem216#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem216#1.offset);havoc xstrtou_range_sfx_#t~mem216#1.base, xstrtou_range_sfx_#t~mem216#1.offset; [2025-02-08 13:27:59,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881: assume -1 == xmalloc_readlink_~readsize~0#1;call ULTIMATE.dealloc(xmalloc_readlink_~buf~1#1.base, xmalloc_readlink_~buf~1#1.offset);xmalloc_readlink_#res#1.base, xmalloc_readlink_#res#1.offset := 0, 0; [2025-02-08 13:27:59,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881: assume !(-1 == xmalloc_readlink_~readsize~0#1);havoc xmalloc_readlink_~return_value_xrealloc$1~0#1.base, xmalloc_readlink_~return_value_xrealloc$1~0#1.offset, xmalloc_readlink_~return_value_readlink$2~0#1; [2025-02-08 13:27:59,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815-1: assume false; [2025-02-08 13:27:59,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815-1: assume !false; [2025-02-08 13:27:59,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815: assume true; [2025-02-08 13:27:59,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815: assume !true;havoc __main_#t~nondet193#1;call ULTIMATE.dealloc(__main_~buf~0#1.base, __main_~buf~0#1.offset);__main_#res#1 := 0;main_#t~ret284#1 := __main_#res#1;havoc __main_#t~varargs185#1.base, __main_#t~varargs185#1.offset, __main_#t~ret186#1, __main_#t~mem187#1.base, __main_#t~mem187#1.offset, __main_#t~bitwise188#1, __main_#t~ret189#1.base, __main_#t~ret189#1.offset, __main_#t~ret190#1.base, __main_#t~ret190#1.offset, __main_#t~ret191#1, __main_#t~bitwise192#1, __main_#t~nondet193#1, __main_~argc#1, __main_~argv#1.base, __main_~argv#1.offset, __main_~buf~0#1.base, __main_~buf~0#1.offset, __main_~fname~0#1.base, __main_~fname~0#1.offset, __main_~opt~0#1;havoc __main_#in~argc#1, __main_#in~argv#1.base, __main_#in~argv#1.offset;assume { :end_inline___main } true;assume -2147483648 <= main_#t~ret284#1 && main_#t~ret284#1 <= 2147483647;main_~res~0#1 := main_#t~ret284#1;havoc main_#t~ret284#1;main_~i~6#1 := 0; [2025-02-08 13:27:59,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2716: assume true;call getopt32_#t~mem149#1 := read~int#16(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:27:59,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2716: assume !true; [2025-02-08 13:27:59,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2716-2: assume !!((if getopt32_#t~mem149#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem149#1 % 256 % 4294967296 else getopt32_#t~mem149#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem149#1; [2025-02-08 13:27:59,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2716-2: assume !((if getopt32_#t~mem149#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem149#1 % 256 % 4294967296 else getopt32_#t~mem149#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem149#1;call getopt32_#t~mem150#1 := read~int#16(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:27:59,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717: assume 0 == (if getopt32_#t~mem150#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem150#1 % 256 % 4294967296 else getopt32_#t~mem150#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem150#1; [2025-02-08 13:27:59,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717: assume !(0 == (if getopt32_#t~mem150#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem150#1 % 256 % 4294967296 else getopt32_#t~mem150#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem150#1;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~on_off~0#1.base, 34 + getopt32_~on_off~0#1.offset; [2025-02-08 13:27:59,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2949: assume 0 == xstrtou_range_sfx_#t~mem217#1;havoc xstrtou_range_sfx_#t~mem217#1;call write~int#10(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:27:59,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2949: assume !(0 == xstrtou_range_sfx_#t~mem217#1);havoc xstrtou_range_sfx_#t~mem217#1; [2025-02-08 13:27:59,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719-1: [2025-02-08 13:27:59,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719: assume 0 != getopt32_#t~bitwise152#1 % 4294967296;havoc getopt32_#t~mem151#1;havoc getopt32_#t~bitwise152#1; [2025-02-08 13:27:59,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719: assume !(0 != getopt32_#t~bitwise152#1 % 4294967296);havoc getopt32_#t~mem151#1;havoc getopt32_#t~bitwise152#1;call getopt32_#t~mem153#1 := read~int#16(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem154#1 := read~int#16(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:27:59,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719-3: assume getopt32_#t~mem151#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise152#1 := getopt32_#t~mem151#1; [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719-3: assume !(getopt32_#t~mem151#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719-2: havoc getopt32_#t~bitwise152#1;assume getopt32_#t~bitwise152#1 % 4294967296 <= getopt32_#t~mem151#1 % 4294967296 && getopt32_#t~bitwise152#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719-5: call getopt32_#t~mem151#1 := read~int#16(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719-4: assume 0 == getopt32_#t~mem151#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise152#1 := 0; [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719-4: assume !(0 == getopt32_#t~mem151#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2390: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2721-1: [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2721: getopt32_~trigger~0#1 := getopt32_#t~bitwise155#1;havoc getopt32_#t~mem153#1;havoc getopt32_#t~mem154#1;havoc getopt32_#t~bitwise155#1;call getopt32_#t~mem156#1 := read~int#16(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2721-3: assume getopt32_#t~mem153#1 % 4294967296 == getopt32_#t~mem154#1 % 4294967296;getopt32_#t~bitwise155#1 := getopt32_#t~mem153#1; [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2721-3: assume !(getopt32_#t~mem153#1 % 4294967296 == getopt32_#t~mem154#1 % 4294967296); [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2721-2: havoc getopt32_#t~bitwise155#1;assume getopt32_#t~bitwise155#1 % 4294967296 <= getopt32_#t~mem153#1 % 4294967296 && getopt32_#t~bitwise155#1 % 4294967296 <= getopt32_#t~mem154#1 % 4294967296; [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2721-4: assume 0 == getopt32_#t~mem153#1 % 4294967296 || 0 == getopt32_#t~mem154#1 % 4294967296;getopt32_#t~bitwise155#1 := 0; [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2721-4: assume !(0 == getopt32_#t~mem153#1 % 4294967296 || 0 == getopt32_#t~mem154#1 % 4294967296); [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986: havoc xstrtou_range_sfx_#t~varargs226#1.base, xstrtou_range_sfx_#t~varargs226#1.offset;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset;xatou_range_#t~ret197#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem211#1, xstrtou_range_sfx_#t~mem212#1, xstrtou_range_sfx_#t~mem213#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem214#1, xstrtou_range_sfx_#t~ret215#1, xstrtou_range_sfx_#t~mem216#1.base, xstrtou_range_sfx_#t~mem216#1.offset, xstrtou_range_sfx_#t~mem217#1, xstrtou_range_sfx_#t~mem218#1, xstrtou_range_sfx_#t~mem219#1.base, xstrtou_range_sfx_#t~mem219#1.offset, xstrtou_range_sfx_#t~nondet220#1, xstrtou_range_sfx_#t~mem221#1, xstrtou_range_sfx_#t~mem222#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem223#1.base, xstrtou_range_sfx_#t~mem223#1.offset, xstrtou_range_sfx_#t~mem224#1, xstrtou_range_sfx_#t~varargs225#1.base, xstrtou_range_sfx_#t~varargs225#1.offset, xstrtou_range_sfx_#t~varargs226#1.base, xstrtou_range_sfx_#t~varargs226#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~0#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~2#1, xstrtou_range_sfx_~tmp_if_expr$3~1#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;havoc xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;assume { :end_inline_xstrtou_range_sfx } true;xatou_range_~return_value_xstrtou_range_sfx$1~0#1 := xatou_range_#t~ret197#1;havoc xatou_range_#t~ret197#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986-2: call xstrtou_range_sfx_#t~varargs226#1.base, xstrtou_range_sfx_#t~varargs226#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#9(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs226#1.base, xstrtou_range_sfx_#t~varargs226#1.offset, 8); [2025-02-08 13:27:59,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2953-1: assume !(0 == xstrtou_range_sfx_#t~mem218#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem218#1; [2025-02-08 13:27:59,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2953-1: assume !!(0 == xstrtou_range_sfx_#t~mem218#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem218#1; [2025-02-08 13:27:59,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2986-1: SUMMARY for call bb_error_msg_and_die(14, 0, xstrtou_range_sfx_#t~varargs226#1.base, xstrtou_range_sfx_#t~varargs226#1.offset); srcloc: null [2025-02-08 13:27:59,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2953: assume true;call xstrtou_range_sfx_#t~mem218#1 := read~int#8(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:27:59,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2953: assume !true; [2025-02-08 13:27:59,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2887-1: assume 1 + xmalloc_readlink_~readsize~0#1 >= -2147483648; [2025-02-08 13:27:59,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2887-1: assume !(1 + xmalloc_readlink_~readsize~0#1 >= -2147483648); [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2887: assume 1 + xmalloc_readlink_~readsize~0#1 <= 2147483647; [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2887: assume !(1 + xmalloc_readlink_~readsize~0#1 <= 2147483647); [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: assume true;call llist_add_to_end_#t~mem181#1.base, llist_add_to_end_#t~mem181#1.offset := read~$Pointer$#18(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: assume !true; [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788-2: assume !!(llist_add_to_end_#t~mem181#1.base == 0 && llist_add_to_end_#t~mem181#1.offset == 0);havoc llist_add_to_end_#t~mem181#1.base, llist_add_to_end_#t~mem181#1.offset; [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788-2: assume !(llist_add_to_end_#t~mem181#1.base == 0 && llist_add_to_end_#t~mem181#1.offset == 0);havoc llist_add_to_end_#t~mem181#1.base, llist_add_to_end_#t~mem181#1.offset;call llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset := read~$Pointer$#18(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset;havoc llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset; [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722: getopt32_~flags~0#1 := getopt32_#t~bitwise158#1;havoc getopt32_#t~mem156#1;havoc getopt32_#t~bitwise157#1;havoc getopt32_#t~bitwise158#1;call getopt32_#t~mem159#1 := read~int#16(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-2: havoc getopt32_#t~bitwise158#1;assume getopt32_#t~bitwise158#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise158#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise157#1) % 4294967296; [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-1: [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise157#1) % 4294967296;getopt32_#t~bitwise158#1 := 0; [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise157#1) % 4294967296); [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise157#1) % 4294967296;getopt32_#t~bitwise158#1 := getopt32_~flags~0#1; [2025-02-08 13:27:59,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise157#1) % 4294967296); [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-6: havoc getopt32_#t~bitwise157#1;assume getopt32_#t~bitwise157#1 % 4294967296 <= getopt32_#t~mem156#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-5: [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise157#1 := getopt32_#t~mem156#1; [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-7: assume getopt32_#t~mem156#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise157#1 := 0; [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-7: assume !(getopt32_#t~mem156#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-9: assume 0 == getopt32_#t~mem156#1 % 4294967296;getopt32_#t~bitwise157#1 := getopt32_~trigger~0#1; [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2722-9: assume !(0 == getopt32_#t~mem156#1 % 4294967296); [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2227-1: SUMMARY for call bb_verror_msg(bb_error_msg_~s#1.base, bb_error_msg_~s#1.offset, bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset, 0, 0); srcloc: null [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2227: call ULTIMATE.dealloc(bb_error_msg_~p~0#1.base, 0);havoc bb_error_msg_~s#1.base, bb_error_msg_~s#1.offset, bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset;havoc bb_error_msg_#in~s#1.base, bb_error_msg_#in~s#1.offset, bb_error_msg_#varArgs#1.base, bb_error_msg_#varArgs#1.offset;assume { :end_inline_bb_error_msg } true;havoc xmalloc_readlink_or_warn_~errmsg~0#1.base, xmalloc_readlink_or_warn_~errmsg~0#1.offset, xmalloc_readlink_or_warn_~err~0#1;havoc xmalloc_readlink_or_warn_#t~varargs207#1.base, xmalloc_readlink_or_warn_#t~varargs207#1.offset; [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-1: [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723: getopt32_~flags~0#1 := getopt32_#t~bitwise161#1;havoc getopt32_#t~mem159#1;havoc getopt32_#t~bitwise160#1;havoc getopt32_#t~bitwise161#1; [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-3: assume 0 == getopt32_#t~bitwise160#1 % 4294967296;getopt32_#t~bitwise161#1 := getopt32_~flags~0#1; [2025-02-08 13:27:59,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-3: assume !(0 == getopt32_#t~bitwise160#1 % 4294967296); [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-2: havoc getopt32_#t~bitwise161#1;assume (getopt32_#t~bitwise161#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise161#1 % 4294967296 >= getopt32_#t~bitwise160#1 % 4294967296) && getopt32_#t~bitwise161#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise160#1 % 4294967296; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-5: [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise160#1 % 4294967296;getopt32_#t~bitwise161#1 := getopt32_#t~bitwise160#1; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise160#1 % 4294967296); [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-7: assume getopt32_#t~mem159#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise160#1 := 0; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-7: assume !(getopt32_#t~mem159#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-6: havoc getopt32_#t~bitwise160#1;assume getopt32_#t~bitwise160#1 % 4294967296 <= getopt32_#t~mem159#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-9: assume 0 == getopt32_#t~mem159#1 % 4294967296;getopt32_#t~bitwise160#1 := getopt32_~trigger~0#1; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-9: assume !(0 == getopt32_#t~mem159#1 % 4294967296); [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise160#1 := getopt32_#t~mem159#1; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2955: havoc xstrtou_range_sfx_~__s1_len~0#1;havoc xstrtou_range_sfx_~__s2_len~0#1;havoc xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;call xstrtou_range_sfx_#t~mem219#1.base, xstrtou_range_sfx_#t~mem219#1.offset := read~$Pointer$#19(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1 := xstrtou_range_sfx_#t~nondet220#1;havoc xstrtou_range_sfx_#t~mem219#1.base, xstrtou_range_sfx_#t~mem219#1.offset;havoc xstrtou_range_sfx_#t~nondet220#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2790: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;assume { :begin_inline_xzalloc } true;xzalloc_#in~size#1 := 16;havoc xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret227#1.base, xzalloc_#t~ret227#1.offset, xzalloc_#t~memset~res228#1.base, xzalloc_#t~memset~res228#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;xzalloc_~size#1 := xzalloc_#in~size#1;havoc xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724: getopt32_~flags~0#1 := getopt32_#t~bitwise162#1;havoc getopt32_#t~bitwise162#1;call getopt32_#t~mem163#1.base, getopt32_#t~mem163#1.offset := read~$Pointer$#16(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724-2: havoc getopt32_#t~bitwise162#1;assume getopt32_#t~bitwise162#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724-1: [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise162#1 := getopt32_~flags~0#1; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise162#1 := 0; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise162#1 := getopt32_~trigger~0#1; [2025-02-08 13:27:59,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:27:59,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: llist_add_to_end_#t~ret183#1.base, llist_add_to_end_#t~ret183#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret227#1.base, xzalloc_#t~ret227#1.offset, xzalloc_#t~memset~res228#1.base, xzalloc_#t~memset~res228#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;havoc xzalloc_#in~size#1;assume { :end_inline_xzalloc } true;llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset := llist_add_to_end_#t~ret183#1.base, llist_add_to_end_#t~ret183#1.offset;havoc llist_add_to_end_#t~ret183#1.base, llist_add_to_end_#t~ret183#1.offset;call write~$Pointer$#18(llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call llist_add_to_end_#t~mem184#1.base, llist_add_to_end_#t~mem184#1.offset := read~$Pointer$#18(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$#18(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem184#1.base, 8 + llist_add_to_end_#t~mem184#1.offset, 8);havoc llist_add_to_end_#t~mem184#1.base, llist_add_to_end_#t~mem184#1.offset;havoc llist_add_to_end_#t~mem181#1.base, llist_add_to_end_#t~mem181#1.offset, llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset, llist_add_to_end_#t~ret183#1.base, llist_add_to_end_#t~ret183#1.offset, llist_add_to_end_#t~mem184#1.base, llist_add_to_end_#t~mem184#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;havoc llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset;assume { :end_inline_llist_add_to_end } true; [2025-02-08 13:27:59,213 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2725: assume !(getopt32_#t~mem163#1.base == 0 && getopt32_#t~mem163#1.offset == 0);havoc getopt32_#t~mem163#1.base, getopt32_#t~mem163#1.offset;call getopt32_#t~mem164#1.base, getopt32_#t~mem164#1.offset := read~$Pointer$#16(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem165#1.base, getopt32_#t~mem165#1.offset := read~$Pointer$#16(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem166#1 := read~int#18(getopt32_#t~mem165#1.base, getopt32_#t~mem165#1.offset, 4); [2025-02-08 13:27:59,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2725: assume !!(getopt32_#t~mem163#1.base == 0 && getopt32_#t~mem163#1.offset == 0);havoc getopt32_#t~mem163#1.base, getopt32_#t~mem163#1.offset; [2025-02-08 13:27:59,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2263: assume bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295;call write~int#10(34, ~bb_errno~0.base, ~bb_errno~0.offset, 4);bb_strtoui_#res#1 := 4294967295; [2025-02-08 13:27:59,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2263: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:27:59,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2726: assume 1 + getopt32_#t~mem166#1 <= 2147483647;call write~int#18(1 + getopt32_#t~mem166#1, getopt32_#t~mem164#1.base, getopt32_#t~mem164#1.offset, 4); [2025-02-08 13:27:59,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2726: assume !(1 + getopt32_#t~mem166#1 <= 2147483647); [2025-02-08 13:27:59,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2726-1: assume 1 + getopt32_#t~mem166#1 >= -2147483648; [2025-02-08 13:27:59,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2726-1: assume !(1 + getopt32_#t~mem166#1 >= -2147483648); [2025-02-08 13:27:59,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2991-1: SUMMARY for call xzalloc_#t~ret227#1.base, xzalloc_#t~ret227#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:27:59,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2991: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret227#1.base, xzalloc_#t~ret227#1.offset;havoc xzalloc_#t~ret227#1.base, xzalloc_#t~ret227#1.offset; [2025-02-08 13:27:59,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2727: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem167#1 := read~int#16(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:27:59,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2727: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:27:59,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2992: havoc xzalloc_#t~memset~res228#1.base, xzalloc_#t~memset~res228#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:27:59,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2992-1: SUMMARY for call xzalloc_#t~memset~res228#1.base, xzalloc_#t~memset~res228#1.offset := #Ultimate.C_memset#18(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:27:59,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem221#1 := read~int#8(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:27:59,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume !(0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1);havoc xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_~suffixes#1.base, 8 + xstrtou_range_sfx_~suffixes#1.offset; [2025-02-08 13:27:59,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2894: xmalloc_readlink_or_warn_#t~ret203#1.base, xmalloc_readlink_or_warn_#t~ret203#1.offset := xmalloc_readlink_#res#1.base, xmalloc_readlink_#res#1.offset;havoc xmalloc_readlink_#t~ret201#1.base, xmalloc_readlink_#t~ret201#1.offset, xmalloc_readlink_#t~ret202#1, xmalloc_readlink_~return_value_xrealloc$1~0#1.base, xmalloc_readlink_~return_value_xrealloc$1~0#1.offset, xmalloc_readlink_~return_value_readlink$2~0#1, xmalloc_readlink_~path#1.base, xmalloc_readlink_~path#1.offset, xmalloc_readlink_~buf~1#1.base, xmalloc_readlink_~buf~1#1.offset, xmalloc_readlink_~bufsize~0#1, xmalloc_readlink_~readsize~0#1;havoc xmalloc_readlink_#in~path#1.base, xmalloc_readlink_#in~path#1.offset;assume { :end_inline_xmalloc_readlink } true;xmalloc_readlink_or_warn_~buf~2#1.base, xmalloc_readlink_or_warn_~buf~2#1.offset := xmalloc_readlink_or_warn_#t~ret203#1.base, xmalloc_readlink_or_warn_#t~ret203#1.offset;havoc xmalloc_readlink_or_warn_#t~ret203#1.base, xmalloc_readlink_or_warn_#t~ret203#1.offset; [2025-02-08 13:27:59,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927: assume 45 == xstrtou_range_sfx_#t~mem211#1;havoc xstrtou_range_sfx_#t~mem211#1;xstrtou_range_sfx_~tmp_if_expr$1~2#1 := 1; [2025-02-08 13:27:59,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927: assume !(45 == xstrtou_range_sfx_#t~mem211#1);havoc xstrtou_range_sfx_#t~mem211#1;call xstrtou_range_sfx_#t~mem212#1 := read~int#18(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1);xstrtou_range_sfx_~tmp_if_expr$1~2#1 := (if 0 == (if 0 != (if 43 == xstrtou_range_sfx_#t~mem212#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:27:59,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: assume 1 == getopt32_#t~mem167#1;havoc getopt32_#t~mem167#1;call getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset := read~$Pointer$#16(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);assume { :begin_inline_llist_add_to_end } true;llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset := getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem181#1.base, llist_add_to_end_#t~mem181#1.offset, llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset, llist_add_to_end_#t~ret183#1.base, llist_add_to_end_#t~ret183#1.offset, llist_add_to_end_#t~mem184#1.base, llist_add_to_end_#t~mem184#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset;llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset := llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset; [2025-02-08 13:27:59,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: assume !(1 == getopt32_#t~mem167#1);havoc getopt32_#t~mem167#1;call getopt32_#t~mem169#1 := read~int#16(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:27:59,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2895: assume xmalloc_readlink_or_warn_~buf~2#1.base == 0 && xmalloc_readlink_or_warn_~buf~2#1.offset == 0;xmalloc_readlink_or_warn_~errmsg~0#1.base, xmalloc_readlink_or_warn_~errmsg~0#1.offset := 11, 0;call xmalloc_readlink_or_warn_#t~mem204#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4);xmalloc_readlink_or_warn_~err~0#1 := xmalloc_readlink_or_warn_#t~mem204#1;havoc xmalloc_readlink_or_warn_#t~mem204#1; [2025-02-08 13:27:59,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2895: assume !(xmalloc_readlink_or_warn_~buf~2#1.base == 0 && xmalloc_readlink_or_warn_~buf~2#1.offset == 0); [2025-02-08 13:27:59,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: assume !(4294967295 / (xstrtou_range_sfx_#t~mem221#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem221#1; [2025-02-08 13:27:59,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem221#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem221#1;call xstrtou_range_sfx_#t~mem222#1 := read~int#8(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_~r~0#1 * xstrtou_range_sfx_#t~mem222#1;havoc xstrtou_range_sfx_#t~mem222#1; [2025-02-08 13:27:59,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2732: assume 2 == getopt32_#t~mem169#1;havoc getopt32_#t~mem169#1;havoc getopt32_~return_value_xatoi_positive$13~0#1;assume { :begin_inline_xatoi_positive } true;xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset := ~optarg~0.base, ~optarg~0.offset;havoc xatoi_positive_#res#1;havoc xatoi_positive_#t~ret196#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset := xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;havoc xatoi_positive_~return_value_xatou_range$1~0#1;assume { :begin_inline_xatou_range } true;xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1 := xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, 0, 2147483647;havoc xatou_range_#res#1;havoc xatou_range_#t~ret197#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset := xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset;xatou_range_~lower#1 := xatou_range_#in~lower#1;xatou_range_~upper#1 := xatou_range_#in~upper#1;havoc xatou_range_~return_value_xstrtou_range_sfx$1~0#1;assume { :begin_inline_xstrtou_range_sfx } true;xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset := xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, 10, xatou_range_~lower#1, xatou_range_~upper#1, 0, 0;havoc xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem211#1, xstrtou_range_sfx_#t~mem212#1, xstrtou_range_sfx_#t~mem213#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem214#1, xstrtou_range_sfx_#t~ret215#1, xstrtou_range_sfx_#t~mem216#1.base, xstrtou_range_sfx_#t~mem216#1.offset, xstrtou_range_sfx_#t~mem217#1, xstrtou_range_sfx_#t~mem218#1, xstrtou_range_sfx_#t~mem219#1.base, xstrtou_range_sfx_#t~mem219#1.offset, xstrtou_range_sfx_#t~nondet220#1, xstrtou_range_sfx_#t~mem221#1, xstrtou_range_sfx_#t~mem222#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem223#1.base, xstrtou_range_sfx_#t~mem223#1.offset, xstrtou_range_sfx_#t~mem224#1, xstrtou_range_sfx_#t~varargs225#1.base, xstrtou_range_sfx_#t~varargs225#1.offset, xstrtou_range_sfx_#t~varargs226#1.base, xstrtou_range_sfx_#t~varargs226#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~0#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~2#1, xstrtou_range_sfx_~tmp_if_expr$3~1#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset := xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset;xstrtou_range_sfx_~base#1 := xstrtou_range_sfx_#in~base#1;xstrtou_range_sfx_~lower#1 := xstrtou_range_sfx_#in~lower#1;xstrtou_range_sfx_~upper#1 := xstrtou_range_sfx_#in~upper#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;havoc xstrtou_range_sfx_~r~0#1;havoc xstrtou_range_sfx_~old_errno~0#1;call xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset := #Ultimate.allocOnStack(8);havoc xstrtou_range_sfx_~tmp_if_expr$1~2#1;call xstrtou_range_sfx_#t~mem211#1 := read~int#18(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:27:59,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2732: assume !(2 == getopt32_#t~mem169#1);havoc getopt32_#t~mem169#1;call getopt32_#t~mem172#1.base, getopt32_#t~mem172#1.offset := read~$Pointer$#16(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:27:59,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2931: havoc xstrtou_range_sfx_~tmp_if_expr$3~1#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:27:59,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2998: assume 0 != readlink_#t~nondet230#1 || readlink_~bufsiz#1 % 18446744073709551616 < 1;havoc readlink_#t~nondet230#1;readlink_#res#1 := -1; [2025-02-08 13:27:59,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2998: assume !(0 != readlink_#t~nondet230#1 || readlink_~bufsiz#1 % 18446744073709551616 < 1);havoc readlink_#t~nondet230#1;havoc readlink_#t~nondet231#1;readlink_~len~0#1 := readlink_#t~nondet231#1;havoc readlink_#t~nondet231#1; [2025-02-08 13:27:59,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2899: assume !(22 == xmalloc_readlink_or_warn_~err~0#1); [2025-02-08 13:27:59,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2899: assume !!(22 == xmalloc_readlink_or_warn_~err~0#1); [2025-02-08 13:27:59,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900: xmalloc_readlink_or_warn_~errmsg~0#1.base, xmalloc_readlink_or_warn_~errmsg~0#1.offset := xmalloc_readlink_or_warn_#t~nondet205#1.base, xmalloc_readlink_or_warn_#t~nondet205#1.offset; [2025-02-08 13:27:59,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~2#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~1#1 := 1; [2025-02-08 13:27:59,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~2#1 % 256);call xstrtou_range_sfx_#t~mem213#1 := read~int#18(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:27:59,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900-1: assume true;xmalloc_readlink_or_warn_#t~nondet205#1.base, xmalloc_readlink_or_warn_#t~nondet205#1.offset := 0, 0; [2025-02-08 13:27:59,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900-1: assume true;havoc xmalloc_readlink_or_warn_#t~nondet206#1;assume xmalloc_readlink_or_warn_#t~nondet206#1 % 18446744073709551616 > 0;call xmalloc_readlink_or_warn_#t~nondet205#1.base, xmalloc_readlink_or_warn_#t~nondet205#1.offset := #Ultimate.allocOnHeap(xmalloc_readlink_or_warn_#t~nondet206#1 % 18446744073709551616);call write~int#18(0, xmalloc_readlink_or_warn_#t~nondet205#1.base, xmalloc_readlink_or_warn_#t~nondet206#1 % 18446744073709551616 - 1, 1); [2025-02-08 13:27:59,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735: getopt32_#t~ret170#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret196#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;havoc xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;assume { :end_inline_xatoi_positive } true;assume -2147483648 <= getopt32_#t~ret170#1 && getopt32_#t~ret170#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret170#1;havoc getopt32_#t~ret170#1;call getopt32_#t~mem171#1.base, getopt32_#t~mem171#1.offset := read~$Pointer$#16(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int#18(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem171#1.base, getopt32_#t~mem171#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem171#1.base, getopt32_#t~mem171#1.offset; [2025-02-08 13:27:59,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3066: havoc getopt_long_#t~ret265#1;getopt32_#t~ret148#1 := getopt_long_#res#1;havoc getopt_long_#t~mem261#1.base, getopt_long_#t~mem261#1.offset, getopt_long_#t~mem262#1, getopt_long_#t~mem263#1.base, getopt_long_#t~mem263#1.offset, getopt_long_#t~mem264#1, getopt_long_#t~ret265#1, getopt_long_~argc#1, getopt_long_~#argv#1.base, getopt_long_~#argv#1.offset, getopt_long_~optstring#1.base, getopt_long_~optstring#1.offset, getopt_long_~longopts#1.base, getopt_long_~longopts#1.offset, getopt_long_~longindex#1.base, getopt_long_~longindex#1.offset;havoc getopt_long_#in~argc#1, getopt_long_#in~argv#1.base, getopt_long_#in~argv#1.offset, getopt_long_#in~optstring#1.base, getopt_long_#in~optstring#1.offset, getopt_long_#in~longopts#1.base, getopt_long_#in~longopts#1.offset, getopt_long_#in~longindex#1.base, getopt_long_#in~longindex#1.offset;assume { :end_inline_getopt_long } true;assume -2147483648 <= getopt32_#t~ret148#1 && getopt32_#t~ret148#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret148#1;havoc getopt32_#t~ret148#1; [2025-02-08 13:27:59,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3066-2: getopt_long_#t~ret265#1 := getopt_#res#1;havoc getopt_#t~mem245#1.base, getopt_#t~mem245#1.offset, getopt_#t~mem246#1, getopt_#t~short247#1, getopt_#t~nondet248#1, getopt_#t~nondet249#1, getopt_#t~mem250#1, getopt_#t~short251#1, getopt_#t~nondet252#1, getopt_#t~mem253#1, getopt_#t~nondet254#1, getopt_#t~pre255#1, getopt_#t~mem256#1, getopt_#t~short257#1, getopt_#t~nondet258#1, getopt_#t~mem259#1.base, getopt_#t~mem259#1.offset, getopt_#t~pre260#1, getopt_~argc#1, getopt_~argv#1.base, getopt_~argv#1.offset, getopt_~optstring#1.base, getopt_~optstring#1.offset, getopt_~result~0#1, getopt_~opt_index~0#1;havoc getopt_#in~argc#1, getopt_#in~argv#1.base, getopt_#in~argv#1.offset, getopt_#in~optstring#1.base, getopt_#in~optstring#1.offset;assume { :end_inline_getopt } true;assume -2147483648 <= getopt_long_#t~ret265#1 && getopt_long_#t~ret265#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret265#1;havoc getopt_long_#t~ret265#1; [2025-02-08 13:27:59,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2901: call xmalloc_readlink_or_warn_#t~varargs207#1.base, xmalloc_readlink_or_warn_#t~varargs207#1.offset := #Ultimate.allocOnHeap(16);call write~$Pointer$#9(xmalloc_readlink_or_warn_~path#1.base, xmalloc_readlink_or_warn_~path#1.offset, xmalloc_readlink_or_warn_#t~varargs207#1.base, xmalloc_readlink_or_warn_#t~varargs207#1.offset, 8);call write~$Pointer$#9(xmalloc_readlink_or_warn_~errmsg~0#1.base, xmalloc_readlink_or_warn_~errmsg~0#1.offset, xmalloc_readlink_or_warn_#t~varargs207#1.base, 8 + xmalloc_readlink_or_warn_#t~varargs207#1.offset, 8);assume { :begin_inline_bb_error_msg } true;bb_error_msg_#in~s#1.base, bb_error_msg_#in~s#1.offset, bb_error_msg_#varArgs#1.base, bb_error_msg_#varArgs#1.offset := 12, 0, xmalloc_readlink_or_warn_#t~varargs207#1.base, xmalloc_readlink_or_warn_#t~varargs207#1.offset;havoc bb_error_msg_~s#1.base, bb_error_msg_~s#1.offset, bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset;bb_error_msg_~s#1.base, bb_error_msg_~s#1.offset := bb_error_msg_#in~s#1.base, bb_error_msg_#in~s#1.offset;havoc bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset;bb_error_msg_~p~0#1.base, bb_error_msg_~p~0#1.offset := bb_error_msg_#varArgs#1.base, bb_error_msg_#varArgs#1.offset; [2025-02-08 13:27:59,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3001-1: SUMMARY for call assume_abort_if_not((if readlink_~len~0#1 % 18446744073709551616 <= readlink_~bufsiz#1 % 18446744073709551616 then 1 else 0)); srcloc: null [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968: assume 0 == xstrtou_range_sfx_#t~mem224#1;havoc xstrtou_range_sfx_#t~mem223#1.base, xstrtou_range_sfx_#t~mem223#1.offset;havoc xstrtou_range_sfx_#t~mem224#1; [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968: assume !(0 == xstrtou_range_sfx_#t~mem224#1);havoc xstrtou_range_sfx_#t~mem223#1.base, xstrtou_range_sfx_#t~mem223#1.offset;havoc xstrtou_range_sfx_#t~mem224#1; [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3001: readlink_~i~1#1 := 0; [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-1: call xstrtou_range_sfx_#t~mem223#1.base, xstrtou_range_sfx_#t~mem223#1.offset := read~$Pointer$#19(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem224#1 := read~int#18(xstrtou_range_sfx_#t~mem223#1.base, xstrtou_range_sfx_#t~mem223#1.offset, 1); [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3002: assume readlink_~i~1#1 % 18446744073709551616 < readlink_~len~0#1 % 18446744073709551616;havoc readlink_#t~nondet232#1;assume -128 <= readlink_#t~nondet232#1 && readlink_#t~nondet232#1 <= 127;call write~int#17(readlink_#t~nondet232#1, readlink_~buf#1.base, readlink_~buf#1.offset + (if readlink_~i~1#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then readlink_~i~1#1 % 18446744073709551616 % 18446744073709551616 else readlink_~i~1#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), 1);readlink_#t~pre233#1 := 1 + readlink_~i~1#1;readlink_~i~1#1 := 1 + readlink_~i~1#1;havoc readlink_#t~pre233#1; [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3002: assume !(readlink_~i~1#1 % 18446744073709551616 < readlink_~len~0#1 % 18446744073709551616);havoc readlink_~i~1#1;readlink_#res#1 := (if readlink_~len~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then readlink_~len~0#1 % 18446744073709551616 % 18446744073709551616 else readlink_~len~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2903-1: xmalloc_readlink_or_warn_#res#1.base, xmalloc_readlink_or_warn_#res#1.offset := xmalloc_readlink_or_warn_~buf~2#1.base, xmalloc_readlink_or_warn_~buf~2#1.offset; [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2837: xatoi_positive_#t~ret196#1 := xatou_range_#res#1;havoc xatou_range_#t~ret197#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;havoc xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1;assume { :end_inline_xatou_range } true;xatoi_positive_~return_value_xatou_range$1~0#1 := xatoi_positive_#t~ret196#1;havoc xatoi_positive_#t~ret196#1;xatoi_positive_#res#1 := (if xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 <= 2147483647 then xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 else xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937-1: assume xstrtou_range_sfx_#t~mem213#1 - 9 >= -2147483648; [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937-1: assume !(xstrtou_range_sfx_#t~mem213#1 - 9 >= -2147483648); [2025-02-08 13:27:59,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: assume xstrtou_range_sfx_#t~mem213#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem213#1 - 9;havoc xstrtou_range_sfx_#t~mem213#1;xstrtou_range_sfx_~tmp_statement_expression$2~0#1 := (if 0 == (if 23 == (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) || (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) <= 4 then 1 else 0) then 0 else 1);xstrtou_range_sfx_~tmp_if_expr$3~1#1 := (if 0 == (if 0 != (if 0 != xstrtou_range_sfx_~tmp_statement_expression$2~0#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1);havoc xstrtou_range_sfx_~bb__isspace~0#1; [2025-02-08 13:27:59,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: assume !(xstrtou_range_sfx_#t~mem213#1 - 9 <= 2147483647); [2025-02-08 13:27:59,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739: assume !(getopt32_#t~mem172#1.base == 0 && getopt32_#t~mem172#1.offset == 0);havoc getopt32_#t~mem172#1.base, getopt32_#t~mem172#1.offset;call getopt32_#t~mem173#1.base, getopt32_#t~mem173#1.offset := read~$Pointer$#16(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$#18(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem173#1.base, getopt32_#t~mem173#1.offset, 8); [2025-02-08 13:27:59,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739: assume !!(getopt32_#t~mem172#1.base == 0 && getopt32_#t~mem172#1.offset == 0);havoc getopt32_#t~mem172#1.base, getopt32_#t~mem172#1.offset; [2025-02-08 13:27:59,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2872-1: assume !(xmalloc_readlink_~bufsize~0#1 >= 1 + xmalloc_readlink_~readsize~0#1); [2025-02-08 13:27:59,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2872-1: assume !!(xmalloc_readlink_~bufsize~0#1 >= 1 + xmalloc_readlink_~readsize~0#1); [2025-02-08 13:27:59,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: assume xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:27:59,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: assume !(xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:27:59,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2709-1: assume true; [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2709-1: assume !true; [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106: assume main_~i~6#1 < main_~argc~1#1;call main_#t~mem285#1.base, main_#t~mem285#1.offset := read~$Pointer$#4(main_~mem_track~0#1.base, main_~mem_track~0#1.offset + 8 * main_~i~6#1, 8);call ULTIMATE.dealloc(main_#t~mem285#1.base, main_#t~mem285#1.offset); [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106: assume !(main_~i~6#1 < main_~argc~1#1);havoc main_~i~6#1;call ULTIMATE.dealloc(main_~mem_track~0#1.base, main_~mem_track~0#1.offset);call ULTIMATE.dealloc(main_~argv~0#1.base, main_~argv~0#1.offset);call ULTIMATE.dealloc(main_~a~0#1.base, main_~a~0#1.offset);main_#res#1 := main_~res~0#1;#t~ret287#1 := main_#res#1;havoc main_#t~malloc270#1.base, main_#t~malloc270#1.offset, main_#t~nondet271#1, main_#t~pre272#1, main_~i~4#1, main_#t~nondet273#1, main_#t~nondet274#1, main_#t~malloc275#1.base, main_#t~malloc275#1.offset, main_#t~malloc276#1.base, main_#t~malloc276#1.offset, main_#t~malloc277#1.base, main_#t~malloc277#1.offset, main_#t~mem278#1.base, main_#t~mem278#1.offset, main_#t~mem279#1.base, main_#t~mem279#1.offset, main_#t~mem280#1.base, main_#t~mem280#1.offset, main_#t~nondet281#1, main_#t~pre282#1, main_~j~0#1, main_#t~pre283#1, main_~i~5#1, main_#t~ret284#1, main_#t~mem285#1.base, main_#t~mem285#1.offset, main_#t~pre286#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~1#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;assume { :end_inline_main } true; [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106-2: assume 1 + main_~i~6#1 >= -2147483648; [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106-2: assume !(1 + main_~i~6#1 >= -2147483648); [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106-1: assume 1 + main_~i~6#1 <= 2147483647;main_#t~pre286#1 := 1 + main_~i~6#1;main_~i~6#1 := 1 + main_~i~6#1;havoc main_#t~pre286#1; [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106-1: assume !(1 + main_~i~6#1 <= 2147483647); [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~0#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296); [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2908: xmalloc_realpath_#t~ret208#1.base, xmalloc_realpath_#t~ret208#1.offset := realpath_#res#1.base, realpath_#res#1.offset;havoc realpath_#t~nondet234#1, realpath_#t~nondet235#1, realpath_#t~malloc236#1.base, realpath_#t~malloc236#1.offset, realpath_~path#1.base, realpath_~path#1.offset, realpath_~resolved_path#1.base, realpath_~resolved_path#1.offset, realpath_~offset~0#1;havoc realpath_#in~path#1.base, realpath_#in~path#1.offset, realpath_#in~resolved_path#1.base, realpath_#in~resolved_path#1.offset;assume { :end_inline_realpath } true;xmalloc_realpath_~return_value_realpath$1~0#1.base, xmalloc_realpath_~return_value_realpath$1~0#1.offset := xmalloc_realpath_#t~ret208#1.base, xmalloc_realpath_#t~ret208#1.offset;havoc xmalloc_realpath_#t~ret208#1.base, xmalloc_realpath_#t~ret208#1.offset;xmalloc_realpath_#res#1.base, xmalloc_realpath_#res#1.offset := xmalloc_realpath_~return_value_realpath$1~0#1.base, xmalloc_realpath_~return_value_realpath$1~0#1.offset; [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2941: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:27:59,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2809: __main_#t~ret189#1.base, __main_#t~ret189#1.offset := xmalloc_realpath_#res#1.base, xmalloc_realpath_#res#1.offset;havoc xmalloc_realpath_#t~ret208#1.base, xmalloc_realpath_#t~ret208#1.offset, xmalloc_realpath_~path#1.base, xmalloc_realpath_~path#1.offset, xmalloc_realpath_~return_value_realpath$1~0#1.base, xmalloc_realpath_~return_value_realpath$1~0#1.offset;havoc xmalloc_realpath_#in~path#1.base, xmalloc_realpath_#in~path#1.offset;assume { :end_inline_xmalloc_realpath } true;__main_~buf~0#1.base, __main_~buf~0#1.offset := __main_#t~ret189#1.base, __main_#t~ret189#1.offset; [2025-02-08 13:27:59,402 INFO L? ?]: Removed 630 outVars from TransFormulas that were not future-live. [2025-02-08 13:27:59,403 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:27:59,455 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:27:59,459 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:27:59,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:27:59 BoogieIcfgContainer [2025-02-08 13:27:59,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:27:59,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:27:59,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:27:59,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:27:59,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:27:50" (1/3) ... [2025-02-08 13:27:59,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8c20cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:27:59, skipping insertion in model container [2025-02-08 13:27:59,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:51" (2/3) ... [2025-02-08 13:27:59,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8c20cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:27:59, skipping insertion in model container [2025-02-08 13:27:59,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:27:59" (3/3) ... [2025-02-08 13:27:59,467 INFO L128 eAbstractionObserver]: Analyzing ICFG readlink-1.i [2025-02-08 13:27:59,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:27:59,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG readlink-1.i that has 71 procedures, 647 locations, 1 initial locations, 74 loop locations, and 73 error locations. [2025-02-08 13:27:59,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:27:59,579 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;@4677d800, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:27:59,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2025-02-08 13:27:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 406 states, 299 states have (on average 1.7090301003344481) internal successors, (511), 381 states have internal predecessors, (511), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 13:27:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:27:59,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:59,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:27:59,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:27:59,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1227316, now seen corresponding path program 1 times [2025-02-08 13:27:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:59,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671595168] [2025-02-08 13:27:59,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:00,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:28:00,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:28:00,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:00,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:28:00,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671595168] [2025-02-08 13:28:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671595168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:00,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:00,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:28:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948636647] [2025-02-08 13:28:00,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:00,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:00,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:00,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:00,629 INFO L87 Difference]: Start difference. First operand has 406 states, 299 states have (on average 1.7090301003344481) internal successors, (511), 381 states have internal predecessors, (511), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:28:00,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:00,729 INFO L93 Difference]: Finished difference Result 621 states and 839 transitions. [2025-02-08 13:28:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:00,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 13:28:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:00,740 INFO L225 Difference]: With dead ends: 621 [2025-02-08 13:28:00,740 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:28:00,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:00,746 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:00,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 518 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:28:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:28:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 152 states have (on average 1.5263157894736843) internal successors, (232), 185 states have internal predecessors, (232), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2025-02-08 13:28:00,790 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 3 [2025-02-08 13:28:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:00,790 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2025-02-08 13:28:00,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:28:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2025-02-08 13:28:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:28:00,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:00,793 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:28:00,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:28:00,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:00,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2090571779, now seen corresponding path program 1 times [2025-02-08 13:28:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:00,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513747301] [2025-02-08 13:28:00,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:01,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:28:01,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:28:01,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:01,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:28:01,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:01,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513747301] [2025-02-08 13:28:01,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513747301] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:01,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880367608] [2025-02-08 13:28:01,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:01,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:01,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:01,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:01,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:28:02,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:28:02,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:28:02,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:02,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:02,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:02,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:28:02,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:02,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880367608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:02,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:02,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:28:02,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631412739] [2025-02-08 13:28:02,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:02,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:28:02,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:02,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:28:02,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:02,332 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:28:06,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:06,438 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2025-02-08 13:28:06,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:28:06,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:28:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:06,440 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:28:06,440 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:28:06,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:06,441 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:06,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 700 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:28:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 13:28:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 152 states have (on average 1.519736842105263) internal successors, (231), 184 states have internal predecessors, (231), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2025-02-08 13:28:06,452 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 6 [2025-02-08 13:28:06,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:06,452 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2025-02-08 13:28:06,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:28:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2025-02-08 13:28:06,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:28:06,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:06,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:28:06,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 13:28:06,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:06,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:06,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash -383214538, now seen corresponding path program 1 times [2025-02-08 13:28:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:06,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873947936] [2025-02-08 13:28:06,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:06,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:28:06,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:28:06,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:06,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:28:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873947936] [2025-02-08 13:28:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873947936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:07,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:07,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300060241] [2025-02-08 13:28:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:07,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:07,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:07,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:07,112 INFO L87 Difference]: Start difference. First operand 198 states and 246 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:28:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:07,172 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-02-08 13:28:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:07,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:28:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:07,174 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:28:07,175 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 13:28:07,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:07,176 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 468 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:07,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 468 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 13:28:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-02-08 13:28:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.52) internal successors, (228), 181 states have internal predecessors, (228), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-08 13:28:07,192 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 7 [2025-02-08 13:28:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:07,193 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-08 13:28:07,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:28:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-08 13:28:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:28:07,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:07,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:07,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:28:07,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:07,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1609207457, now seen corresponding path program 1 times [2025-02-08 13:28:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438223428] [2025-02-08 13:28:07,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:07,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:28:07,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:28:07,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:07,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:28:07,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438223428] [2025-02-08 13:28:07,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438223428] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:07,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911594993] [2025-02-08 13:28:07,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:07,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:07,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:07,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:07,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:28:08,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:28:08,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:28:08,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:08,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:08,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:28:08,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:28:08,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911594993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:08,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:08,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:28:08,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171536501] [2025-02-08 13:28:08,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:08,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:08,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:08,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:08,606 INFO L87 Difference]: Start difference. First operand 195 states and 243 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:12,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:12,735 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2025-02-08 13:28:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:28:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:12,736 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:28:12,736 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:28:12,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:12,737 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 15 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:12,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 443 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:28:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-08 13:28:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 179 states have internal predecessors, (226), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2025-02-08 13:28:12,755 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 11 [2025-02-08 13:28:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:12,756 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2025-02-08 13:28:12,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2025-02-08 13:28:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:28:12,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:12,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:12,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:28:12,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:12,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:12,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1654177550, now seen corresponding path program 1 times [2025-02-08 13:28:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476427779] [2025-02-08 13:28:12,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:13,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:28:13,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:28:13,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:13,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:28:13,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:13,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476427779] [2025-02-08 13:28:13,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476427779] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:13,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256948460] [2025-02-08 13:28:13,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:13,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:13,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:13,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:13,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:28:14,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:28:14,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:28:14,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:14,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:14,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:14,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:28:14,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:28:14,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256948460] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:14,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:14,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:28:14,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611313069] [2025-02-08 13:28:14,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:14,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:14,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:14,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:14,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:14,298 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:14,382 INFO L93 Difference]: Finished difference Result 390 states and 488 transitions. [2025-02-08 13:28:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:14,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:28:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:14,384 INFO L225 Difference]: With dead ends: 390 [2025-02-08 13:28:14,384 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 13:28:14,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:14,385 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:14,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 464 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:28:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 13:28:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 13:28:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 188 states have internal predecessors, (235), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2025-02-08 13:28:14,405 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 250 transitions. Word has length 12 [2025-02-08 13:28:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:14,405 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 250 transitions. [2025-02-08 13:28:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2025-02-08 13:28:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:28:14,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:14,407 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:14,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:28:14,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:14,610 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:14,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1520415429, now seen corresponding path program 2 times [2025-02-08 13:28:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958194477] [2025-02-08 13:28:14,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:28:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:14,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:28:14,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:28:14,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:28:14,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:28:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958194477] [2025-02-08 13:28:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958194477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:15,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:15,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:28:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066650062] [2025-02-08 13:28:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:28:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:15,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:28:15,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:15,359 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:19,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:19,328 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2025-02-08 13:28:19,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:28:19,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:28:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:19,330 INFO L225 Difference]: With dead ends: 202 [2025-02-08 13:28:19,330 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 13:28:19,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:19,331 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 14 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:19,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 881 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 13:28:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 13:28:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-08 13:28:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.4654088050314464) internal successors, (233), 186 states have internal predecessors, (233), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2025-02-08 13:28:19,348 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 21 [2025-02-08 13:28:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:19,348 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2025-02-08 13:28:19,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2025-02-08 13:28:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:28:19,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:19,349 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:19,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:28:19,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:19,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1045406461, now seen corresponding path program 1 times [2025-02-08 13:28:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:19,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639855584] [2025-02-08 13:28:19,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:19,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:19,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:28:19,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:28:19,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:19,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:19,841 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:28:19,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:19,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639855584] [2025-02-08 13:28:19,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639855584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:19,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:19,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:28:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523616] [2025-02-08 13:28:19,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:19,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:19,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:19,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:19,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:19,843 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:23,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:23,941 INFO L93 Difference]: Finished difference Result 384 states and 481 transitions. [2025-02-08 13:28:23,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:23,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:28:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:23,943 INFO L225 Difference]: With dead ends: 384 [2025-02-08 13:28:23,943 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 13:28:23,943 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-08 13:28:23,944 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:23,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 457 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 13:28:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 13:28:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.4567901234567902) internal successors, (236), 189 states have internal predecessors, (236), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2025-02-08 13:28:23,951 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 26 [2025-02-08 13:28:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:23,951 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2025-02-08 13:28:23,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2025-02-08 13:28:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 13:28:23,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:23,952 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-08 13:28:23,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:28:23,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1951804575, now seen corresponding path program 1 times [2025-02-08 13:28:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055359008] [2025-02-08 13:28:23,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:23,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:24,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 13:28:24,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 13:28:24,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:24,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:28:24,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:24,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055359008] [2025-02-08 13:28:24,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055359008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:24,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:24,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709127668] [2025-02-08 13:28:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:24,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:24,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:24,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:24,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:24,410 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:24,468 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2025-02-08 13:28:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:24,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-08 13:28:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:24,471 INFO L225 Difference]: With dead ends: 320 [2025-02-08 13:28:24,471 INFO L226 Difference]: Without dead ends: 318 [2025-02-08 13:28:24,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:24,471 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 140 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 457 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:24,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 457 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-08 13:28:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 207. [2025-02-08 13:28:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 166 states have (on average 1.4518072289156627) internal successors, (241), 193 states have internal predecessors, (241), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 256 transitions. [2025-02-08 13:28:24,483 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 256 transitions. Word has length 27 [2025-02-08 13:28:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:24,484 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 256 transitions. [2025-02-08 13:28:24,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2025-02-08 13:28:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:28:24,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:24,485 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] [2025-02-08 13:28:24,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:28:24,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:24,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash -890102914, now seen corresponding path program 1 times [2025-02-08 13:28:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:24,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884351463] [2025-02-08 13:28:24,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:24,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:24,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:24,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:24,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:24,939 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:28:24,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:24,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884351463] [2025-02-08 13:28:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884351463] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85113346] [2025-02-08 13:28:24,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:24,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:24,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:24,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:24,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:28:25,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:25,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:25,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:25,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:25,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:28:25,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:25,823 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-08 13:28:25,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:25,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85113346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:25,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:25,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:28:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347688377] [2025-02-08 13:28:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:25,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:25,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:25,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:25,825 INFO L87 Difference]: Start difference. First operand 207 states and 256 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:29,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:29,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:29,945 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2025-02-08 13:28:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:29,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 13:28:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:29,947 INFO L225 Difference]: With dead ends: 207 [2025-02-08 13:28:29,947 INFO L226 Difference]: Without dead ends: 206 [2025-02-08 13:28:29,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:29,948 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 3 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:29,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 447 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-08 13:28:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-02-08 13:28:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 166 states have (on average 1.4457831325301205) internal successors, (240), 192 states have internal predecessors, (240), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 255 transitions. [2025-02-08 13:28:29,958 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 255 transitions. Word has length 29 [2025-02-08 13:28:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:29,960 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 255 transitions. [2025-02-08 13:28:29,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 255 transitions. [2025-02-08 13:28:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:28:29,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:29,960 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:29,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:28:30,166 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-08 13:28:30,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:30,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:30,166 INFO L85 PathProgramCache]: Analyzing trace with hash -890102754, now seen corresponding path program 1 times [2025-02-08 13:28:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:30,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050403297] [2025-02-08 13:28:30,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:30,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:30,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:30,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:30,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:28:30,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:30,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050403297] [2025-02-08 13:28:30,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050403297] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:30,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16478576] [2025-02-08 13:28:30,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:30,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:30,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:30,638 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:30,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:28:31,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:31,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:31,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:31,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:31,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:28:31,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:28:31,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:28:31,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16478576] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:31,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:31,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:28:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412684054] [2025-02-08 13:28:31,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:31,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:28:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:31,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:28:31,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:28:31,841 INFO L87 Difference]: Start difference. First operand 206 states and 255 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:28:35,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:39,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:40,152 INFO L93 Difference]: Finished difference Result 415 states and 519 transitions. [2025-02-08 13:28:40,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:28:40,155 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:28:40,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:40,157 INFO L225 Difference]: With dead ends: 415 [2025-02-08 13:28:40,157 INFO L226 Difference]: Without dead ends: 223 [2025-02-08 13:28:40,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:28:40,158 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 5 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:40,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1334 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-08 13:28:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-08 13:28:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-02-08 13:28:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 184 states have (on average 1.3967391304347827) internal successors, (257), 209 states have internal predecessors, (257), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2025-02-08 13:28:40,168 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 29 [2025-02-08 13:28:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:40,168 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2025-02-08 13:28:40,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:28:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2025-02-08 13:28:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:28:40,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:40,171 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:40,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:28:40,371 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,SelfDestructingSolverStorable9 [2025-02-08 13:28:40,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:40,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1494408864, now seen corresponding path program 1 times [2025-02-08 13:28:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:40,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671347614] [2025-02-08 13:28:40,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:40,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:40,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:28:40,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:28:40,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:40,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:28:40,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:40,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671347614] [2025-02-08 13:28:40,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671347614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:40,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:40,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:40,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567077245] [2025-02-08 13:28:40,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:40,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:40,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:40,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:40,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:40,819 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:44,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:44,924 INFO L93 Difference]: Finished difference Result 234 states and 285 transitions. [2025-02-08 13:28:44,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:44,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:28:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:44,926 INFO L225 Difference]: With dead ends: 234 [2025-02-08 13:28:44,926 INFO L226 Difference]: Without dead ends: 233 [2025-02-08 13:28:44,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:44,927 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:44,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-08 13:28:44,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2025-02-08 13:28:44,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 193 states have (on average 1.3937823834196892) internal successors, (269), 218 states have internal predecessors, (269), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2025-02-08 13:28:44,942 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 48 [2025-02-08 13:28:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:44,942 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2025-02-08 13:28:44,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2025-02-08 13:28:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:28:44,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:44,944 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:44,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:28:44,944 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:44,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1494413829, now seen corresponding path program 1 times [2025-02-08 13:28:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672877682] [2025-02-08 13:28:44,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:45,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:28:45,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:28:45,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:45,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:28:45,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:45,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672877682] [2025-02-08 13:28:45,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672877682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:45,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:45,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:45,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216705527] [2025-02-08 13:28:45,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:45,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:45,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:45,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:45,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:45,343 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:49,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:49,428 INFO L93 Difference]: Finished difference Result 232 states and 284 transitions. [2025-02-08 13:28:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:49,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:28:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:49,430 INFO L225 Difference]: With dead ends: 232 [2025-02-08 13:28:49,430 INFO L226 Difference]: Without dead ends: 231 [2025-02-08 13:28:49,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:49,431 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:49,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-08 13:28:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2025-02-08 13:28:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 189 states have (on average 1.3915343915343916) internal successors, (263), 213 states have internal predecessors, (263), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2025-02-08 13:28:49,440 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 48 [2025-02-08 13:28:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:49,441 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2025-02-08 13:28:49,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2025-02-08 13:28:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:28:49,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:49,445 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-08 13:28:49,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:28:49,445 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:49,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1029175421, now seen corresponding path program 1 times [2025-02-08 13:28:49,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:49,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343627590] [2025-02-08 13:28:49,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:49,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:49,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:28:49,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:28:49,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:49,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343627590] [2025-02-08 13:28:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343627590] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118964008] [2025-02-08 13:28:49,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:49,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:49,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:49,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:49,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:28:50,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:28:50,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:28:50,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:50,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:50,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1640 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:50,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:50,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:50,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118964008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:50,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:50,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:28:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103533249] [2025-02-08 13:28:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:50,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:28:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:50,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:28:50,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:50,742 INFO L87 Difference]: Start difference. First operand 227 states and 278 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:50,836 INFO L93 Difference]: Finished difference Result 338 states and 426 transitions. [2025-02-08 13:28:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:28:50,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-08 13:28:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:50,839 INFO L225 Difference]: With dead ends: 338 [2025-02-08 13:28:50,839 INFO L226 Difference]: Without dead ends: 337 [2025-02-08 13:28:50,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:50,840 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 279 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:50,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 684 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:28:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-08 13:28:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 226. [2025-02-08 13:28:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 189 states have (on average 1.3862433862433863) internal successors, (262), 212 states have internal predecessors, (262), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2025-02-08 13:28:50,853 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 49 [2025-02-08 13:28:50,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:50,854 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2025-02-08 13:28:50,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2025-02-08 13:28:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:28:50,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:50,855 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:50,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 13:28:51,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:28:51,056 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:51,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1839665838, now seen corresponding path program 1 times [2025-02-08 13:28:51,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:51,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966895087] [2025-02-08 13:28:51,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:51,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:28:51,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:28:51,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:51,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966895087] [2025-02-08 13:28:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966895087] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727169350] [2025-02-08 13:28:51,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:51,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:51,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:51,445 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-08 13:28:52,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:28:52,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:28:52,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:52,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:52,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:52,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:52,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727169350] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:52,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:28:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708697968] [2025-02-08 13:28:52,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:52,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:52,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:52,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:52,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:52,463 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) 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-08 13:28:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:52,644 INFO L93 Difference]: Finished difference Result 683 states and 887 transitions. [2025-02-08 13:28:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:52,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) 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 50 [2025-02-08 13:28:52,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:52,648 INFO L225 Difference]: With dead ends: 683 [2025-02-08 13:28:52,648 INFO L226 Difference]: Without dead ends: 682 [2025-02-08 13:28:52,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:52,649 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 938 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:52,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1011 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:28:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-08 13:28:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 238. [2025-02-08 13:28:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 201 states have (on average 1.3781094527363185) internal successors, (277), 224 states have internal predecessors, (277), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2025-02-08 13:28:52,664 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 50 [2025-02-08 13:28:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:52,664 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2025-02-08 13:28:52,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) 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-08 13:28:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2025-02-08 13:28:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:28:52,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:52,666 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:52,681 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-08 13:28:52,866 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-08 13:28:52,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:28:52,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:52,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1893768605, now seen corresponding path program 1 times [2025-02-08 13:28:52,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:52,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933859940] [2025-02-08 13:28:52,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:52,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:53,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:28:53,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:28:53,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:53,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:28:53,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:53,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933859940] [2025-02-08 13:28:53,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933859940] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:53,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516840896] [2025-02-08 13:28:53,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:53,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:53,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:53,242 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-08 13:28:53,245 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-08 13:28:53,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:28:54,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:28:54,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:54,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:54,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 1702 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:54,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:28:54,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:28:54,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516840896] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:54,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:28:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294783128] [2025-02-08 13:28:54,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:54,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:54,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:54,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:54,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:54,302 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:58,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:02,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:06,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:10,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:14,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:14,549 INFO L93 Difference]: Finished difference Result 452 states and 562 transitions. [2025-02-08 13:29:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:29:14,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-08 13:29:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:14,551 INFO L225 Difference]: With dead ends: 452 [2025-02-08 13:29:14,551 INFO L226 Difference]: Without dead ends: 256 [2025-02-08 13:29:14,551 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-08 13:29:14,552 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 4 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:14,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-02-08 13:29:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-08 13:29:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-02-08 13:29:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 219 states have (on average 1.3470319634703196) internal successors, (295), 242 states have internal predecessors, (295), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:29:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 310 transitions. [2025-02-08 13:29:14,564 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 310 transitions. Word has length 55 [2025-02-08 13:29:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:14,564 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 310 transitions. [2025-02-08 13:29:14,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:29:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 310 transitions. [2025-02-08 13:29:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 13:29:14,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:14,565 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-08 13:29:14,580 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-08 13:29:14,766 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,SelfDestructingSolverStorable14 [2025-02-08 13:29:14,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:29:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash 274863584, now seen corresponding path program 1 times [2025-02-08 13:29:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721854429] [2025-02-08 13:29:14,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:14,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 13:29:14,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 13:29:14,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:14,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:29:15,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721854429] [2025-02-08 13:29:15,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721854429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:29:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288720190] [2025-02-08 13:29:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:15,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:29:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:15,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:29:15,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:29:15,550 INFO L87 Difference]: Start difference. First operand 256 states and 310 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)