./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/uname-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/uname-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ce381cf603602873aa7825ca610797c82dd7f7e7d56006b032fdfc5a2bfa2e82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:29:42,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:29:43,014 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:29:43,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:29:43,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:29:43,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:29:43,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:29:43,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:29:43,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:29:43,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:29:43,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:29:43,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:29:43,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:29:43,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:29:43,044 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:29:43,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:29:43,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:29:43,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:29:43,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:29:43,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:29:43,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:29:43,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:29:43,045 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:29:43,045 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:29:43,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:29:43,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:29:43,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:29:43,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:29:43,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:29:43,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:29:43,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:29:43,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:43,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:29:43,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:29:43,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:29:43,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:29:43,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:29:43,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:29:43,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:29:43,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:29:43,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:29:43,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:29:43,048 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 -> ce381cf603602873aa7825ca610797c82dd7f7e7d56006b032fdfc5a2bfa2e82 [2025-02-08 13:29:43,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:29:43,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:29:43,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:29:43,316 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:29:43,317 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:29:43,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/uname-2.i [2025-02-08 13:29:44,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d93e804a6/da6d674da5d549cbab8bd9e78f89db79/FLAGf5d2970b0 [2025-02-08 13:29:44,967 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:29:44,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/uname-2.i [2025-02-08 13:29:44,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d93e804a6/da6d674da5d549cbab8bd9e78f89db79/FLAGf5d2970b0 [2025-02-08 13:29:45,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d93e804a6/da6d674da5d549cbab8bd9e78f89db79 [2025-02-08 13:29:45,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:29:45,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:29:45,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:45,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:29:45,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:29:45,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:45" (1/1) ... [2025-02-08 13:29:45,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56810f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:45, skipping insertion in model container [2025-02-08 13:29:45,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:45" (1/1) ... [2025-02-08 13:29:45,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:29:46,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:46,055 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:29:46,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:46,321 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:29:46,327 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:29:46,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46 WrapperNode [2025-02-08 13:29:46,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:46,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:46,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:29:46,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:29:46,336 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:29:46" (1/1) ... [2025-02-08 13:29:46,362 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:29:46" (1/1) ... [2025-02-08 13:29:46,427 INFO L138 Inliner]: procedures = 570, calls = 888, calls flagged for inlining = 24, calls inlined = 22, statements flattened = 2089 [2025-02-08 13:29:46,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:46,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:29:46,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:29:46,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:29:46,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,465 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:29:46,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:29:46,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:29:46,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:29:46,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:29:46,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (1/1) ... [2025-02-08 13:29:46,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:46,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:46,599 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:29:46,632 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:29:46,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:29:46,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:29:46,659 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:29:46,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:29:46,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:29:46,659 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-08 13:29:46,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:29:46,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:29:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:29:46,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:29:46,661 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-08 13:29:46,661 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-08 13:29:46,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:29:46,662 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:29:46,662 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:29:46,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:29:47,046 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:29:47,048 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:29:47,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2356: #t~ret65#1 := full_write_#res#1;havoc full_write_#t~ret72#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~ret65#1 && #t~ret65#1 <= 9223372036854775807;havoc #t~mem64#1.base, #t~mem64#1.offset;havoc #t~ret65#1; [2025-02-08 13:29:47,398 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3067-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:29:47,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3067: write_#res#1 := write_~ret~1#1; [2025-02-08 13:29:47,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2390: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:47,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2390: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:29:47,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2813-1: assume 0 != safe_write_~tmp_if_expr$1~1#1 % 256; [2025-02-08 13:29:47,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2813-1: assume !(0 != safe_write_~tmp_if_expr$1~1#1 % 256); [2025-02-08 13:29:47,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2813: 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:29:47,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2813: assume !true; [2025-02-08 13:29:47,399 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2822-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:29:47,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2385: 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~ret186#1, safe_write_#t~mem187#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:29:47,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2385: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:47,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815: safe_write_#t~ret186#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~ret186#1 && safe_write_#t~ret186#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret186#1;havoc safe_write_#t~ret186#1; [2025-02-08 13:29:47,400 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2394: 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:29:47,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2394: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:29:47,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2394-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:29:47,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2394-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:29:47,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2816: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem187#1 := read~int(~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~mem187#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:47,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2816: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~1#1 := 0; [2025-02-08 13:29:47,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2387: full_write_#t~ret72#1 := safe_write_#res#1;havoc safe_write_#t~ret186#1, safe_write_#t~mem187#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~ret72#1 && full_write_#t~ret72#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret72#1;havoc full_write_#t~ret72#1; [2025-02-08 13:29:47,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: assume full_write_~cc~0#1 < 0; [2025-02-08 13:29:47,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:29:47,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2355: #t~ret63#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet69#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret63#1 && #t~ret63#1 <= 2147483647;havoc #t~ret63#1;call #t~mem64#1.base, #t~mem64#1.offset := read~$Pointer$(~#msg~0#1.base, ~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, #t~mem64#1.base, #t~mem64#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret72#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:30:43,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-1: SUMMARY for call xzalloc_#t~ret222#1.base, xzalloc_#t~ret222#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:30:43,619 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret222#1.base, xzalloc_#t~ret222#1.offset;havoc xzalloc_#t~ret222#1.base, xzalloc_#t~ret222#1.offset; [2025-02-08 13:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2976: havoc xzalloc_#t~memset~res223#1.base, xzalloc_#t~memset~res223#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2976-1: SUMMARY for call xzalloc_#t~memset~res223#1.base, xzalloc_#t~memset~res223#1.offset := #Ultimate.C_memset(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2944: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem216#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2944: 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:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2911: assume 45 == xstrtou_range_sfx_#t~mem206#1;havoc xstrtou_range_sfx_#t~mem206#1;xstrtou_range_sfx_~tmp_if_expr$1~2#1 := 1; [2025-02-08 13:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2911: assume !(45 == xstrtou_range_sfx_#t~mem206#1);havoc xstrtou_range_sfx_#t~mem206#1;call xstrtou_range_sfx_#t~mem207#1 := read~int(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~mem207#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: assume 2 == getopt32_#t~mem170#1;havoc getopt32_#t~mem170#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~ret201#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~ret202#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~mem206#1, xstrtou_range_sfx_#t~mem207#1, xstrtou_range_sfx_#t~mem208#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem209#1, xstrtou_range_sfx_#t~ret210#1, xstrtou_range_sfx_#t~mem211#1.base, xstrtou_range_sfx_#t~mem211#1.offset, xstrtou_range_sfx_#t~mem212#1, xstrtou_range_sfx_#t~mem213#1, xstrtou_range_sfx_#t~mem214#1.base, xstrtou_range_sfx_#t~mem214#1.offset, xstrtou_range_sfx_#t~nondet215#1, xstrtou_range_sfx_#t~mem216#1, xstrtou_range_sfx_#t~mem217#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~mem218#1.base, xstrtou_range_sfx_#t~mem218#1.offset, xstrtou_range_sfx_#t~mem219#1, xstrtou_range_sfx_#t~varargs220#1.base, xstrtou_range_sfx_#t~varargs220#1.offset, xstrtou_range_sfx_#t~varargs221#1.base, xstrtou_range_sfx_#t~varargs221#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~mem206#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: assume !(2 == getopt32_#t~mem170#1);havoc getopt32_#t~mem170#1;call getopt32_#t~mem173#1.base, getopt32_#t~mem173#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: assume !(4294967295 / (xstrtou_range_sfx_#t~mem216#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem216#1; [2025-02-08 13:30:43,620 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem216#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem216#1;call xstrtou_range_sfx_#t~mem217#1 := read~int(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~mem217#1;havoc xstrtou_range_sfx_#t~mem217#1; [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749: getopt32_#t~ret171#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret201#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~ret171#1 && getopt32_#t~ret171#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret171#1;havoc getopt32_#t~ret171#1;call getopt32_#t~mem172#1.base, getopt32_#t~mem172#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem172#1.base, getopt32_#t~mem172#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem172#1.base, getopt32_#t~mem172#1.offset; [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2915: havoc xstrtou_range_sfx_~tmp_if_expr$3~1#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917: 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:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~2#1 % 256);call xstrtou_range_sfx_#t~mem208#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753: assume !(getopt32_#t~mem173#1.base == 0 && getopt32_#t~mem173#1.offset == 0);havoc getopt32_#t~mem173#1.base, getopt32_#t~mem173#1.offset;call getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset, 8); [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753: assume !!(getopt32_#t~mem173#1.base == 0 && getopt32_#t~mem173#1.offset == 0);havoc getopt32_#t~mem173#1.base, getopt32_#t~mem173#1.offset; [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: assume 0 == xstrtou_range_sfx_#t~mem219#1;havoc xstrtou_range_sfx_#t~mem218#1.base, xstrtou_range_sfx_#t~mem218#1.offset;havoc xstrtou_range_sfx_#t~mem219#1; [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952: assume !(0 == xstrtou_range_sfx_#t~mem219#1);havoc xstrtou_range_sfx_#t~mem218#1.base, xstrtou_range_sfx_#t~mem218#1.offset;havoc xstrtou_range_sfx_#t~mem219#1; [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2952-1: call xstrtou_range_sfx_#t~mem218#1.base, xstrtou_range_sfx_#t~mem218#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem219#1 := read~int(xstrtou_range_sfx_#t~mem218#1.base, xstrtou_range_sfx_#t~mem218#1.offset, 1); [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3053: havoc getopt_long_#t~ret265#1;getopt32_#t~ret149#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~ret149#1 && getopt32_#t~ret149#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret149#1;havoc getopt32_#t~ret149#1; [2025-02-08 13:30:43,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3053-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:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2921-1: assume xstrtou_range_sfx_#t~mem208#1 - 9 >= -2147483648; [2025-02-08 13:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2921-1: assume !(xstrtou_range_sfx_#t~mem208#1 - 9 >= -2147483648); [2025-02-08 13:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2921: assume xstrtou_range_sfx_#t~mem208#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem208#1 - 9;havoc xstrtou_range_sfx_#t~mem208#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:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2921: assume !(xstrtou_range_sfx_#t~mem208#1 - 9 <= 2147483647); [2025-02-08 13:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-1: assume true; [2025-02-08 13:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723-1: assume !true; [2025-02-08 13:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: assume xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: assume !(xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2726: assume -1 == getopt32_~c~0#1; [2025-02-08 13:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2726: 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:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958: 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:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2958: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296); [2025-02-08 13:30:43,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2925: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256;call xstrtou_range_sfx_#t~mem209#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem209#1;havoc xstrtou_range_sfx_#t~mem209#1;call write~int(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~nondet41#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~nondet41#1;havoc bb_strtoui_#t~nondet41#1; [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256); [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2829: call ULTIMATE.dealloc(__main_~#uname_info~0#1.base, __main_~#uname_info~0#1.offset);havoc __main_~#uname_info~0#1.base, __main_~#uname_info~0#1.offset; [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730: assume true;call getopt32_#t~mem150#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730: assume !true; [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730-2: assume !!((if getopt32_#t~mem150#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem150#1 % 256 % 4294967296 else getopt32_#t~mem150#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem150#1; [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730-2: assume !((if getopt32_#t~mem150#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem150#1 % 256 % 4294967296 else getopt32_#t~mem150#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem150#1;call getopt32_#t~mem151#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731: assume 0 == (if getopt32_#t~mem151#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem151#1 % 256 % 4294967296 else getopt32_#t~mem151#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem151#1; [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731: assume !(0 == (if getopt32_#t~mem151#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem151#1 % 256 % 4294967296 else getopt32_#t~mem151#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem151#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:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2963-1: SUMMARY for call bb_error_msg_and_die(12, 0, xstrtou_range_sfx_#t~varargs220#1.base, xstrtou_range_sfx_#t~varargs220#1.offset); srcloc: null [2025-02-08 13:30:43,623 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2930: xstrtou_range_sfx_#t~ret210#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet41#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~ret210#1;havoc xstrtou_range_sfx_#t~ret210#1;call xstrtou_range_sfx_#t~mem211#1.base, xstrtou_range_sfx_#t~mem211#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2963: havoc xstrtou_range_sfx_#t~varargs220#1.base, xstrtou_range_sfx_#t~varargs220#1.offset; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2963-2: call xstrtou_range_sfx_#t~varargs220#1.base, xstrtou_range_sfx_#t~varargs220#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs220#1.base, xstrtou_range_sfx_#t~varargs220#1.offset, 8);call write~int(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs220#1.base, 8 + xstrtou_range_sfx_#t~varargs220#1.offset, 8);call write~int(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs220#1.base, 16 + xstrtou_range_sfx_#t~varargs220#1.offset, 8); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2931: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem211#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem211#1.offset);havoc xstrtou_range_sfx_#t~mem211#1.base, xstrtou_range_sfx_#t~mem211#1.offset;call xstrtou_range_sfx_#t~mem212#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2931: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem211#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem211#1.offset);havoc xstrtou_range_sfx_#t~mem211#1.base, xstrtou_range_sfx_#t~mem211#1.offset; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-1: [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733: assume 0 != getopt32_#t~bitwise153#1 % 4294967296;havoc getopt32_#t~mem152#1;havoc getopt32_#t~bitwise153#1; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733: assume !(0 != getopt32_#t~bitwise153#1 % 4294967296);havoc getopt32_#t~mem152#1;havoc getopt32_#t~bitwise153#1;call getopt32_#t~mem154#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem155#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-3: assume getopt32_#t~mem152#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise153#1 := getopt32_#t~mem152#1; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-3: assume !(getopt32_#t~mem152#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-2: havoc getopt32_#t~bitwise153#1;assume getopt32_#t~bitwise153#1 % 4294967296 <= getopt32_#t~mem152#1 % 4294967296 && getopt32_#t~bitwise153#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-5: call getopt32_#t~mem152#1 := read~int(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-4: assume 0 == getopt32_#t~mem152#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise153#1 := 0; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-4: assume !(0 == getopt32_#t~mem152#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2404: 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:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: assume 0 == xstrtou_range_sfx_#t~mem212#1;havoc xstrtou_range_sfx_#t~mem212#1;call write~int(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: assume !(0 == xstrtou_range_sfx_#t~mem212#1);havoc xstrtou_range_sfx_#t~mem212#1; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-1: [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735: getopt32_~trigger~0#1 := getopt32_#t~bitwise156#1;havoc getopt32_#t~mem154#1;havoc getopt32_#t~mem155#1;havoc getopt32_#t~bitwise156#1;call getopt32_#t~mem157#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-3: assume getopt32_#t~mem154#1 % 4294967296 == getopt32_#t~mem155#1 % 4294967296;getopt32_#t~bitwise156#1 := getopt32_#t~mem154#1; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-3: assume !(getopt32_#t~mem154#1 % 4294967296 == getopt32_#t~mem155#1 % 4294967296); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-2: havoc getopt32_#t~bitwise156#1;assume getopt32_#t~bitwise156#1 % 4294967296 <= getopt32_#t~mem154#1 % 4294967296 && getopt32_#t~bitwise156#1 % 4294967296 <= getopt32_#t~mem155#1 % 4294967296; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-4: assume 0 == getopt32_#t~mem154#1 % 4294967296 || 0 == getopt32_#t~mem155#1 % 4294967296;getopt32_#t~bitwise156#1 := 0; [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-4: assume !(0 == getopt32_#t~mem154#1 % 4294967296 || 0 == getopt32_#t~mem155#1 % 4294967296); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802: assume true;call llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:30:43,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802: assume !true; [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802-2: assume !!(llist_add_to_end_#t~mem182#1.base == 0 && llist_add_to_end_#t~mem182#1.offset == 0);havoc llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset; [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802-2: assume !(llist_add_to_end_#t~mem182#1.base == 0 && llist_add_to_end_#t~mem182#1.offset == 0);havoc llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset;call llist_add_to_end_#t~mem183#1.base, llist_add_to_end_#t~mem183#1.offset := read~$Pointer$(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~mem183#1.base, llist_add_to_end_#t~mem183#1.offset;havoc llist_add_to_end_#t~mem183#1.base, llist_add_to_end_#t~mem183#1.offset; [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736: getopt32_~flags~0#1 := getopt32_#t~bitwise159#1;havoc getopt32_#t~mem157#1;havoc getopt32_#t~bitwise158#1;havoc getopt32_#t~bitwise159#1;call getopt32_#t~mem160#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-2: havoc getopt32_#t~bitwise159#1;assume getopt32_#t~bitwise159#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise159#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise158#1) % 4294967296; [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-1: [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise158#1) % 4294967296;getopt32_#t~bitwise159#1 := 0; [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise158#1) % 4294967296); [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise158#1) % 4294967296;getopt32_#t~bitwise159#1 := getopt32_~flags~0#1; [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise158#1) % 4294967296); [2025-02-08 13:30:43,625 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-6: havoc getopt32_#t~bitwise158#1;assume getopt32_#t~bitwise158#1 % 4294967296 <= getopt32_#t~mem157#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-5: [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise158#1 := getopt32_#t~mem157#1; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-7: assume getopt32_#t~mem157#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise158#1 := 0; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-7: assume !(getopt32_#t~mem157#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-9: assume 0 == getopt32_#t~mem157#1 % 4294967296;getopt32_#t~bitwise158#1 := getopt32_~trigger~0#1; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-9: assume !(0 == getopt32_#t~mem157#1 % 4294967296); [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-1: [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737: getopt32_~flags~0#1 := getopt32_#t~bitwise162#1;havoc getopt32_#t~mem160#1;havoc getopt32_#t~bitwise161#1;havoc getopt32_#t~bitwise162#1; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-3: assume 0 == getopt32_#t~bitwise161#1 % 4294967296;getopt32_#t~bitwise162#1 := getopt32_~flags~0#1; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-3: assume !(0 == getopt32_#t~bitwise161#1 % 4294967296); [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-2: havoc getopt32_#t~bitwise162#1;assume (getopt32_#t~bitwise162#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise162#1 % 4294967296 >= getopt32_#t~bitwise161#1 % 4294967296) && getopt32_#t~bitwise162#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise161#1 % 4294967296; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-5: [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise161#1 % 4294967296;getopt32_#t~bitwise162#1 := getopt32_#t~bitwise161#1; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise161#1 % 4294967296); [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-7: assume getopt32_#t~mem160#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise161#1 := 0; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-7: assume !(getopt32_#t~mem160#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-6: havoc getopt32_#t~bitwise161#1;assume getopt32_#t~bitwise161#1 % 4294967296 <= getopt32_#t~mem160#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-9: assume 0 == getopt32_#t~mem160#1 % 4294967296;getopt32_#t~bitwise161#1 := getopt32_~trigger~0#1; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-9: assume !(0 == getopt32_#t~mem160#1 % 4294967296); [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise161#1 := getopt32_#t~mem160#1; [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:43,626 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: 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~ret222#1.base, xzalloc_#t~ret222#1.offset, xzalloc_#t~memset~res223#1.base, xzalloc_#t~memset~res223#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:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738: getopt32_~flags~0#1 := getopt32_#t~bitwise163#1;havoc getopt32_#t~bitwise163#1;call getopt32_#t~mem164#1.base, getopt32_#t~mem164#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-2: havoc getopt32_#t~bitwise163#1;assume getopt32_#t~bitwise163#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-1: [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise163#1 := getopt32_~flags~0#1; [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise163#1 := 0; [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise163#1 := getopt32_~trigger~0#1; [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: havoc xstrtou_range_sfx_#t~varargs221#1.base, xstrtou_range_sfx_#t~varargs221#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~ret202#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem206#1, xstrtou_range_sfx_#t~mem207#1, xstrtou_range_sfx_#t~mem208#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem209#1, xstrtou_range_sfx_#t~ret210#1, xstrtou_range_sfx_#t~mem211#1.base, xstrtou_range_sfx_#t~mem211#1.offset, xstrtou_range_sfx_#t~mem212#1, xstrtou_range_sfx_#t~mem213#1, xstrtou_range_sfx_#t~mem214#1.base, xstrtou_range_sfx_#t~mem214#1.offset, xstrtou_range_sfx_#t~nondet215#1, xstrtou_range_sfx_#t~mem216#1, xstrtou_range_sfx_#t~mem217#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~mem218#1.base, xstrtou_range_sfx_#t~mem218#1.offset, xstrtou_range_sfx_#t~mem219#1, xstrtou_range_sfx_#t~varargs220#1.base, xstrtou_range_sfx_#t~varargs220#1.offset, xstrtou_range_sfx_#t~varargs221#1.base, xstrtou_range_sfx_#t~varargs221#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~ret202#1;havoc xatou_range_#t~ret202#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:30:43,627 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970-2: call xstrtou_range_sfx_#t~varargs221#1.base, xstrtou_range_sfx_#t~varargs221#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs221#1.base, xstrtou_range_sfx_#t~varargs221#1.offset, 8); [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937-1: assume !(0 == xstrtou_range_sfx_#t~mem213#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem213#1; [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937-1: assume !!(0 == xstrtou_range_sfx_#t~mem213#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem213#1; [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970-1: SUMMARY for call bb_error_msg_and_die(13, 0, xstrtou_range_sfx_#t~varargs221#1.base, xstrtou_range_sfx_#t~varargs221#1.offset); srcloc: null [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: assume true;call xstrtou_range_sfx_#t~mem213#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: assume !true; [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2805: llist_add_to_end_#t~ret184#1.base, llist_add_to_end_#t~ret184#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret222#1.base, xzalloc_#t~ret222#1.offset, xzalloc_#t~memset~res223#1.base, xzalloc_#t~memset~res223#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~ret184#1.base, llist_add_to_end_#t~ret184#1.offset;havoc llist_add_to_end_#t~ret184#1.base, llist_add_to_end_#t~ret184#1.offset;call write~$Pointer$(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~mem185#1.base, llist_add_to_end_#t~mem185#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem185#1.base, 8 + llist_add_to_end_#t~mem185#1.offset, 8);havoc llist_add_to_end_#t~mem185#1.base, llist_add_to_end_#t~mem185#1.offset;havoc llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset, llist_add_to_end_#t~mem183#1.base, llist_add_to_end_#t~mem183#1.offset, llist_add_to_end_#t~ret184#1.base, llist_add_to_end_#t~ret184#1.offset, llist_add_to_end_#t~mem185#1.base, llist_add_to_end_#t~mem185#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:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739: assume !(getopt32_#t~mem164#1.base == 0 && getopt32_#t~mem164#1.offset == 0);havoc getopt32_#t~mem164#1.base, getopt32_#t~mem164#1.offset;call getopt32_#t~mem165#1.base, getopt32_#t~mem165#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem166#1.base, getopt32_#t~mem166#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem167#1 := read~int(getopt32_#t~mem166#1.base, getopt32_#t~mem166#1.offset, 4); [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739: assume !!(getopt32_#t~mem164#1.base == 0 && getopt32_#t~mem164#1.offset == 0);havoc getopt32_#t~mem164#1.base, getopt32_#t~mem164#1.offset; [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2277: assume bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295;call write~int(34, ~bb_errno~0.base, ~bb_errno~0.offset, 4);bb_strtoui_#res#1 := 4294967295; [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2277: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740: assume 1 + getopt32_#t~mem167#1 <= 2147483647;call write~int(1 + getopt32_#t~mem167#1, getopt32_#t~mem165#1.base, getopt32_#t~mem165#1.offset, 4); [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740: assume !(1 + getopt32_#t~mem167#1 <= 2147483647); [2025-02-08 13:30:43,628 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740-1: assume 1 + getopt32_#t~mem167#1 >= -2147483648; [2025-02-08 13:30:43,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740-1: assume !(1 + getopt32_#t~mem167#1 >= -2147483648); [2025-02-08 13:30:43,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2939: 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~mem214#1.base, xstrtou_range_sfx_#t~mem214#1.offset := read~$Pointer$(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~nondet215#1;havoc xstrtou_range_sfx_#t~mem214#1.base, xstrtou_range_sfx_#t~mem214#1.offset;havoc xstrtou_range_sfx_#t~nondet215#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:30:43,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem168#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:30:43,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:30:43,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: xatoi_positive_#t~ret201#1 := xatou_range_#res#1;havoc xatou_range_#t~ret202#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~ret201#1;havoc xatoi_positive_#t~ret201#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:30:43,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2743: assume 1 == getopt32_#t~mem168#1;havoc getopt32_#t~mem168#1;call getopt32_#t~mem169#1.base, getopt32_#t~mem169#1.offset := read~$Pointer$(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~mem169#1.base, getopt32_#t~mem169#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem182#1.base, llist_add_to_end_#t~mem182#1.offset, llist_add_to_end_#t~mem183#1.base, llist_add_to_end_#t~mem183#1.offset, llist_add_to_end_#t~ret184#1.base, llist_add_to_end_#t~ret184#1.offset, llist_add_to_end_#t~mem185#1.base, llist_add_to_end_#t~mem185#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:30:43,629 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2743: assume !(1 == getopt32_#t~mem168#1);havoc getopt32_#t~mem168#1;call getopt32_#t~mem170#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:30:43,718 INFO L? ?]: Removed 385 outVars from TransFormulas that were not future-live. [2025-02-08 13:30:43,718 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:30:43,750 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:30:43,753 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:30:43,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:30:43 BoogieIcfgContainer [2025-02-08 13:30:43,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:30:43,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:30:43,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:30:43,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:30:43,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:29:45" (1/3) ... [2025-02-08 13:30:43,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7fe7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:30:43, skipping insertion in model container [2025-02-08 13:30:43,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:46" (2/3) ... [2025-02-08 13:30:43,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7fe7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:30:43, skipping insertion in model container [2025-02-08 13:30:43,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:30:43" (3/3) ... [2025-02-08 13:30:43,762 INFO L128 eAbstractionObserver]: Analyzing ICFG uname-2.i [2025-02-08 13:30:43,773 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:30:43,777 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uname-2.i that has 8 procedures, 418 locations, 1 initial locations, 37 loop locations, and 73 error locations. [2025-02-08 13:30:43,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:30:43,829 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;@754fdf21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:30:43,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2025-02-08 13:30:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 418 states, 308 states have (on average 1.7207792207792207) internal successors, (530), 396 states have internal predecessors, (530), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 13:30:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:30:43,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:43,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:30:43,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:30:43,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash 843025, now seen corresponding path program 1 times [2025-02-08 13:30:43,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:43,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692860161] [2025-02-08 13:30:43,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:51,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:30:51,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:30:51,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:51,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:52,025 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:30:52,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:52,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692860161] [2025-02-08 13:30:52,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692860161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:52,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:52,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:30:52,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275214316] [2025-02-08 13:30:52,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:52,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:52,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:52,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:52,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:52,045 INFO L87 Difference]: Start difference. First operand has 418 states, 308 states have (on average 1.7207792207792207) internal successors, (530), 396 states have internal predecessors, (530), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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:30:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:52,271 INFO L93 Difference]: Finished difference Result 629 states and 856 transitions. [2025-02-08 13:30:52,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:52,273 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:30:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:52,278 INFO L225 Difference]: With dead ends: 629 [2025-02-08 13:30:52,278 INFO L226 Difference]: Without dead ends: 195 [2025-02-08 13:30:52,282 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:30:52,284 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 510 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:52,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 510 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:30:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-08 13:30:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-02-08 13:30:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 149 states have (on average 1.5302013422818792) internal successors, (228), 182 states have internal predecessors, (228), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-08 13:30:52,348 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 3 [2025-02-08 13:30:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:52,348 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-08 13:30:52,348 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:30:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-08 13:30:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:30:52,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:52,349 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:30:52,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:30:52,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:30:52,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:52,349 INFO L85 PathProgramCache]: Analyzing trace with hash -654467363, now seen corresponding path program 1 times [2025-02-08 13:30:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:52,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432970272] [2025-02-08 13:30:52,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:52,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:59,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:30:59,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:30:59,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:59,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:00,284 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:31:00,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:00,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432970272] [2025-02-08 13:31:00,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432970272] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:00,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541786222] [2025-02-08 13:31:00,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:00,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:00,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:00,291 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:31:00,292 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:31:08,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:31:08,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:31:08,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:08,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:08,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 2829 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:08,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:08,511 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:31:08,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:31:08,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541786222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:08,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:31:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:31:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416614370] [2025-02-08 13:31:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:08,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:31:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:08,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:31:08,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:08,512 INFO L87 Difference]: Start difference. First operand 195 states and 243 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:31:12,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:13,173 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2025-02-08 13:31:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:31:13,176 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:31:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:13,177 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:31:13,177 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 13:31:13,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:31:13,178 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:13,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-08 13:31:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 13:31:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 13:31:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 149 states have (on average 1.523489932885906) internal successors, (227), 181 states have internal predecessors, (227), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 242 transitions. [2025-02-08 13:31:13,185 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 242 transitions. Word has length 6 [2025-02-08 13:31:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:13,186 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 242 transitions. [2025-02-08 13:31:13,186 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:31:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2025-02-08 13:31:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:31:13,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:13,186 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:31:13,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:31:13,389 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:31:13,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:31:13,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1186349011, now seen corresponding path program 1 times [2025-02-08 13:31:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:13,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729300964] [2025-02-08 13:31:13,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:13,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:20,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:31:20,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:31:20,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:20,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:20,837 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:31:20,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729300964] [2025-02-08 13:31:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729300964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:31:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:31:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:31:20,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136228252] [2025-02-08 13:31:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:31:20,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:31:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:20,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:31:20,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:31:20,839 INFO L87 Difference]: Start difference. First operand 194 states and 242 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:31:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:21,038 INFO L93 Difference]: Finished difference Result 194 states and 242 transitions. [2025-02-08 13:31:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:31:21,039 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:31:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:21,042 INFO L225 Difference]: With dead ends: 194 [2025-02-08 13:31:21,042 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:31:21,042 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:31:21,043 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:21,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:31:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:31:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-02-08 13:31:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 147 states have (on average 1.5238095238095237) internal successors, (224), 178 states have internal predecessors, (224), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:31:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 239 transitions. [2025-02-08 13:31:21,057 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 239 transitions. Word has length 7 [2025-02-08 13:31:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:21,057 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 239 transitions. [2025-02-08 13:31:21,057 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:31:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 239 transitions. [2025-02-08 13:31:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:31:21,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:21,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:21,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:31:21,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 70 more)] === [2025-02-08 13:31:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1987864772, now seen corresponding path program 1 times [2025-02-08 13:31:21,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:21,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967693403] [2025-02-08 13:31:21,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms