./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/cut-3.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/cut-3.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 988c48e0cee8e5e54cb1544816ff7acc83725ead86fe141afedc636fed402c33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:24:37,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:24:38,000 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:24:38,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:24:38,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:24:38,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:24:38,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:24:38,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:24:38,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:24:38,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:24:38,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:24:38,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:24:38,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:24:38,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:24:38,026 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:24:38,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:24:38,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:24:38,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:24:38,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:24:38,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:24:38,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:24:38,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:24:38,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:38,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:24:38,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:24:38,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:24:38,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:24:38,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:24:38,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:24:38,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:24:38,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:24:38,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:24:38,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:24:38,029 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 -> 988c48e0cee8e5e54cb1544816ff7acc83725ead86fe141afedc636fed402c33 [2025-02-08 13:24:38,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:24:38,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:24:38,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:24:38,256 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:24:38,258 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:24:38,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/cut-3.i [2025-02-08 13:24:39,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43a87e9c6/9112c0869a9e41989829bc5c92a5ceeb/FLAG273c0bb2d [2025-02-08 13:24:39,763 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:24:39,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/cut-3.i [2025-02-08 13:24:39,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43a87e9c6/9112c0869a9e41989829bc5c92a5ceeb/FLAG273c0bb2d [2025-02-08 13:24:39,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43a87e9c6/9112c0869a9e41989829bc5c92a5ceeb [2025-02-08 13:24:39,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:24:39,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:24:39,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:39,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:24:39,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:24:39,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:39,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7be892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:39, skipping insertion in model container [2025-02-08 13:24:39,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:39" (1/1) ... [2025-02-08 13:24:40,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:24:40,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:40,930 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:24:41,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:41,195 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:24:41,201 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:24:41,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41 WrapperNode [2025-02-08 13:24:41,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:41,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:41,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:24:41,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:24:41,208 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:24:41" (1/1) ... [2025-02-08 13:24:41,238 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:24:41" (1/1) ... [2025-02-08 13:24:41,330 INFO L138 Inliner]: procedures = 581, calls = 896, calls flagged for inlining = 30, calls inlined = 28, statements flattened = 2423 [2025-02-08 13:24:41,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:41,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:24:41,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:24:41,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:24:41,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,433 INFO L175 MemorySlicer]: Split 737 memory accesses to 22 slices as follows [2, 20, 3, 6, 3, 3, 2, 125, 7, 18, 8, 2, 10, 3, 17, 44, 30, 17, 41, 15, 355, 6]. 48 percent of accesses are in the largest equivalence class. The 383 initializations are split as follows [2, 4, 3, 0, 0, 0, 0, 6, 0, 0, 0, 2, 1, 0, 0, 0, 2, 4, 0, 0, 355, 4]. The 176 writes are split as follows [0, 15, 0, 2, 0, 0, 1, 69, 4, 4, 8, 0, 5, 0, 17, 12, 20, 4, 12, 1, 0, 2]. [2025-02-08 13:24:41,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:24:41,546 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:24:41,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:24:41,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:24:41,548 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:41,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:41,577 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:24:41,579 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:24:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-08 13:24:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-08 13:24:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-08 13:24:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-08 13:24:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-08 13:24:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-08 13:24:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-08 13:24:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-08 13:24:41,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-08 13:24:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-08 13:24:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-08 13:24:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-08 13:24:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-08 13:24:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-08 13:24:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-08 13:24:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-08 13:24:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-08 13:24:41,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-08 13:24:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-08 13:24:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-02-08 13:24:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-02-08 13:24:41,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#21 [2025-02-08 13:24:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-08 13:24:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-08 13:24:41,599 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-08 13:24:41,600 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-08 13:24:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-08 13:24:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-08 13:24:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-02-08 13:24:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-02-08 13:24:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#21 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure xatoi_positive [2025-02-08 13:24:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure xatoi_positive [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-02-08 13:24:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure xzalloc [2025-02-08 13:24:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure xzalloc [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-02-08 13:24:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:24:41,602 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:24:41,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:24:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 13:24:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 13:24:41,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 13:24:41,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:24:41,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:24:41,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:24:41,607 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:24:41,608 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:24:41,610 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:24:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 13:24:41,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2025-02-08 13:24:41,613 INFO L138 BoogieDeclarations]: Found implementation of procedure strsep [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-08 13:24:41,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-02-08 13:24:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-02-08 13:24:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:24:41,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 13:24:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 13:24:41,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:24:41,621 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 13:24:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-08 13:24:42,171 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:24:42,173 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:24:42,236 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3328: havoc #t~nondet311.base, #t~nondet311.offset; [2025-02-08 13:24:42,377 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3297: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~1#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~1#1.base, xstrtou_range_sfx_~#e~1#1.offset);havoc xstrtou_range_sfx_~#e~1#1.base, xstrtou_range_sfx_~#e~1#1.offset; [2025-02-08 13:24:42,377 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3297: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296); [2025-02-08 13:24:42,377 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295: assume xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295: assume !(xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3291-1: call xstrtou_range_sfx_#t~mem303#1.base, xstrtou_range_sfx_#t~mem303#1.offset := read~$Pointer$#4(xstrtou_range_sfx_~#e~1#1.base, xstrtou_range_sfx_~#e~1#1.offset, 8);call xstrtou_range_sfx_#t~mem304#1 := read~int#7(xstrtou_range_sfx_#t~mem303#1.base, xstrtou_range_sfx_#t~mem303#1.offset, 1); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3291: assume 0 == xstrtou_range_sfx_#t~mem304#1;havoc xstrtou_range_sfx_#t~mem303#1.base, xstrtou_range_sfx_#t~mem303#1.offset;havoc xstrtou_range_sfx_#t~mem304#1; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3291: assume !(0 == xstrtou_range_sfx_#t~mem304#1);havoc xstrtou_range_sfx_#t~mem303#1.base, xstrtou_range_sfx_#t~mem303#1.offset;havoc xstrtou_range_sfx_#t~mem304#1; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285: assume !(4294967295 / (xstrtou_range_sfx_#t~mem301#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem301#1; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem301#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem301#1;call xstrtou_range_sfx_#t~mem302#1 := read~int#5(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~1#1 := xstrtou_range_sfx_~r~1#1 * xstrtou_range_sfx_#t~mem302#1;havoc xstrtou_range_sfx_#t~mem302#1; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3283: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem301#1 := read~int#5(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3283: 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:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3275: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3275: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302: havoc xstrtou_range_sfx_#t~varargs305#1.base, xstrtou_range_sfx_#t~varargs305#1.offset; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302-2: call xstrtou_range_sfx_#t~varargs305#1.base, xstrtou_range_sfx_#t~varargs305#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$#10(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs305#1.base, xstrtou_range_sfx_#t~varargs305#1.offset, 8);call write~int#10(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs305#1.base, 8 + xstrtou_range_sfx_#t~varargs305#1.offset, 8);call write~int#10(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs305#1.base, 16 + xstrtou_range_sfx_#t~varargs305#1.offset, 8); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302-1: SUMMARY for call bb_error_msg_and_die(20, 0, xstrtou_range_sfx_#t~varargs305#1.base, xstrtou_range_sfx_#t~varargs305#1.offset); srcloc: null [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: xstrtou_range_sfx_#t~ret295#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet47#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~1#1 := xstrtou_range_sfx_#t~ret295#1;havoc xstrtou_range_sfx_#t~ret295#1;call xstrtou_range_sfx_#t~mem296#1.base, xstrtou_range_sfx_#t~mem296#1.offset := read~$Pointer$#4(xstrtou_range_sfx_~#e~1#1.base, xstrtou_range_sfx_~#e~1#1.offset, 8); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3278: 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~mem299#1.base, xstrtou_range_sfx_#t~mem299#1.offset := read~$Pointer$#4(xstrtou_range_sfx_~#e~1#1.base, xstrtou_range_sfx_~#e~1#1.offset, 8);xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1 := xstrtou_range_sfx_#t~nondet300#1;havoc xstrtou_range_sfx_#t~mem299#1.base, xstrtou_range_sfx_#t~mem299#1.offset;havoc xstrtou_range_sfx_#t~nondet300#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3276: assume true;call xstrtou_range_sfx_#t~mem298#1 := read~int#5(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3276: assume !true; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3276-1: assume !(0 == xstrtou_range_sfx_#t~mem298#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem298#1; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3276-1: assume !!(0 == xstrtou_range_sfx_#t~mem298#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem298#1; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3272: assume 0 == xstrtou_range_sfx_#t~mem297#1;havoc xstrtou_range_sfx_#t~mem297#1;call write~int#12(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3272: assume !(0 == xstrtou_range_sfx_#t~mem297#1);havoc xstrtou_range_sfx_#t~mem297#1; [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem296#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem296#1.offset);havoc xstrtou_range_sfx_#t~mem296#1.base, xstrtou_range_sfx_#t~mem296#1.offset;call xstrtou_range_sfx_#t~mem297#1 := read~int#12(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:24:42,378 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem296#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem296#1.offset);havoc xstrtou_range_sfx_#t~mem296#1.base, xstrtou_range_sfx_#t~mem296#1.offset; [2025-02-08 13:24:42,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3388: write_#res#1 := write_~ret~1#1; [2025-02-08 13:24:42,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3388-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:24:42,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: 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~nondet343#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~nondet343#1;assume -9223372036854775808 <= write_#t~nondet343#1 && write_#t~nondet343#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet343#1;havoc write_#t~nondet343#1; [2025-02-08 13:24:42,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: assume !true; [2025-02-08 13:24:42,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166-1: assume 0 != safe_write_~tmp_if_expr$1~2#1 % 256; [2025-02-08 13:24:42,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166-1: assume !(0 != safe_write_~tmp_if_expr$1~2#1 % 256); [2025-02-08 13:24:42,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:24:42,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738: 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~ret272#1, safe_write_#t~mem273#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~2#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~2#1; [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408: #t~ret69#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet151#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret69#1 && #t~ret69#1 <= 2147483647;havoc #t~ret69#1;call #t~mem70#1.base, #t~mem70#1.offset := read~$Pointer$#19(~#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~mem70#1.base, #t~mem70#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret158#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:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3168: safe_write_#t~ret272#1 := write_#res#1;havoc write_#t~nondet343#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~ret272#1 && safe_write_#t~ret272#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret272#1;havoc safe_write_#t~ret272#1; [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747: 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:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2409: #t~ret71#1 := full_write_#res#1;havoc full_write_#t~ret158#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~ret71#1 && #t~ret71#1 <= 9223372036854775807;havoc #t~mem70#1.base, #t~mem70#1.offset;havoc #t~ret71#1; [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem273#1 := read~int#12(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~2#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem273#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~2#1 := 0; [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740: full_write_#t~ret158#1 := safe_write_#res#1;havoc safe_write_#t~ret272#1, safe_write_#t~mem273#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~2#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~ret158#1 && full_write_#t~ret158#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret158#1;havoc full_write_#t~ret158#1; [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: assume full_write_~cc~0#1 < 0; [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2743: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:24:42,733 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2743: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:24:47,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: assume cut_file_#t~short109#1;havoc cut_file_#t~mem107#1;havoc cut_file_#t~mem108#1.base, cut_file_#t~mem108#1.offset;havoc cut_file_#t~short109#1;call cut_file_#t~mem110#1 := read~int#7(cut_file_~cut_lists#1.base, 4 + (cut_file_~cut_lists#1.offset + 8 * (if cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 else cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616)), 4);cut_file_~tmp_if_expr$5~0#1 := (if 0 == (if 0 != (if -1 != cut_file_#t~mem110#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:24:47,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: assume !cut_file_#t~short109#1;havoc cut_file_#t~mem107#1;havoc cut_file_#t~mem108#1.base, cut_file_#t~mem108#1.offset;havoc cut_file_#t~short109#1;cut_file_~tmp_if_expr$5~0#1 := 0; [2025-02-08 13:24:47,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546-1: assume cut_file_#t~short109#1;call cut_file_#t~mem108#1.base, cut_file_#t~mem108#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8);cut_file_#t~short109#1 := !(cut_file_#t~mem108#1.base == 0 && cut_file_#t~mem108#1.offset == 0); [2025-02-08 13:24:47,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546-1: assume !cut_file_#t~short109#1; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2514: assume true;call cut_file_#t~mem100#1.base, cut_file_#t~mem100#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8); [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2514: assume !true; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2514-2: assume !(!(cut_file_#t~mem100#1.base == 0 && cut_file_#t~mem100#1.offset == 0) && !(cut_file_~cl_pos~0#1 % 4294967296 >= cut_file_~nlists#1 % 4294967296));havoc cut_file_#t~mem100#1.base, cut_file_#t~mem100#1.offset; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2514-2: assume !(cut_file_#t~mem100#1.base == 0 && cut_file_#t~mem100#1.offset == 0) && !(cut_file_~cl_pos~0#1 % 4294967296 >= cut_file_~nlists#1 % 4294967296);havoc cut_file_#t~mem100#1.base, cut_file_#t~mem100#1.offset;call cut_file_#t~mem101#1 := read~int#7(cut_file_~cut_lists#1.base, cut_file_~cut_lists#1.offset + 8 * (if cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 else cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 4);cut_file_~spos~0#1 := cut_file_#t~mem101#1;havoc cut_file_#t~mem101#1; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2283-1: bb_get_chunk_from_file_#res#1.base, bb_get_chunk_from_file_#res#1.offset := bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3076-1: assume true; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3076-1: assume !true; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449-1: SUMMARY for call cut_file_#t~ret81#1.base, cut_file_#t~ret81#1.offset := xzalloc(1 + cut_file_~linelen~0#1); srcloc: null [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449: cut_file_~return_value_xzalloc$2~0#1.base, cut_file_~return_value_xzalloc$2~0#1.offset := cut_file_#t~ret81#1.base, cut_file_#t~ret81#1.offset;havoc cut_file_#t~ret81#1.base, cut_file_#t~ret81#1.offset;cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset := cut_file_~return_value_xzalloc$2~0#1.base, cut_file_~return_value_xzalloc$2~0#1.offset;call cut_file_#t~mem82#1.base, cut_file_#t~mem82#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8);cut_file_~orig_line~0#1.base, cut_file_~orig_line~0#1.offset := cut_file_#t~mem82#1.base, cut_file_#t~mem82#1.offset;havoc cut_file_#t~mem82#1.base, cut_file_#t~mem82#1.offset;cut_file_~cl_pos~0#1 := 0;havoc cut_file_~spos~0#1; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449-3: assume 1 + cut_file_~linelen~0#1 >= -2147483648; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449-3: assume !(1 + cut_file_~linelen~0#1 >= -2147483648); [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3374: havoc getopt_long_#t~ret339#1;getopt32_#t~ret235#1 := getopt_long_#res#1;havoc getopt_long_#t~mem335#1.base, getopt_long_#t~mem335#1.offset, getopt_long_#t~mem336#1, getopt_long_#t~mem337#1.base, getopt_long_#t~mem337#1.offset, getopt_long_#t~mem338#1, getopt_long_#t~ret339#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~ret235#1 && getopt32_#t~ret235#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret235#1;havoc getopt32_#t~ret235#1; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449-2: assume 1 + cut_file_~linelen~0#1 <= 2147483647; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449-2: assume !(1 + cut_file_~linelen~0#1 <= 2147483647); [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3374-2: getopt_long_#t~ret339#1 := getopt_#res#1;havoc getopt_#t~mem319#1.base, getopt_#t~mem319#1.offset, getopt_#t~mem320#1, getopt_#t~short321#1, getopt_#t~nondet322#1, getopt_#t~nondet323#1, getopt_#t~mem324#1, getopt_#t~short325#1, getopt_#t~nondet326#1, getopt_#t~mem327#1, getopt_#t~nondet328#1, getopt_#t~pre329#1, getopt_#t~mem330#1, getopt_#t~short331#1, getopt_#t~nondet332#1, getopt_#t~mem333#1.base, getopt_#t~mem333#1.offset, getopt_#t~pre334#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~ret339#1 && getopt_long_#t~ret339#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret339#1;havoc getopt_long_#t~ret339#1; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2252: assume true;assume { :begin_inline__IO_getc } true;_IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset := bb_get_chunk_from_file_~file#1.base, bb_get_chunk_from_file_~file#1.offset;havoc _IO_getc_#res#1;havoc _IO_getc_#t~nondet309#1, _IO_getc_~stream#1.base, _IO_getc_~stream#1.offset;_IO_getc_~stream#1.base, _IO_getc_~stream#1.offset := _IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset;assume -2147483648 <= _IO_getc_#t~nondet309#1 && _IO_getc_#t~nondet309#1 <= 2147483647;_IO_getc_#res#1 := _IO_getc_#t~nondet309#1;havoc _IO_getc_#t~nondet309#1; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2252: assume !true; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2252-1: assume true; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2252-1: assume !true; [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2682: assume !(0 == fclose_if_not_stdin_~r~0#1);call write~int#12(5, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:24:47,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2682: assume !!(0 == fclose_if_not_stdin_~r~0#1); [2025-02-08 13:24:47,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550: assume !(0 == cut_file_~tmp_if_expr$5~0#1 % 256); [2025-02-08 13:24:47,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550: assume !!(0 == cut_file_~tmp_if_expr$5~0#1 % 256);cut_file_~cl_pos~0#1 := 1 + cut_file_~cl_pos~0#1; [2025-02-08 13:24:48,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517-1: assume true; [2025-02-08 13:24:48,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517-1: assume !true; [2025-02-08 13:24:48,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517: assume true;call cut_file_#t~mem102#1.base, cut_file_#t~mem102#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517: assume !true; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079: assume -1 == getopt32_~c~0#1; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079: 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:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2485: assume !(0 == cut_file_~tmp_if_expr$3~1#1 % 256);cut_file_~cl_pos~0#1 := 1 + cut_file_~cl_pos~0#1; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2485: assume !!(0 == cut_file_~tmp_if_expr$3~1#1 % 256); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212: call ULTIMATE.dealloc(xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset);havoc xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset;cut_file_#t~ret77#1.base, cut_file_#t~ret77#1.offset := xmalloc_fgetline_#res#1.base, xmalloc_fgetline_#res#1.offset;havoc xmalloc_fgetline_#t~ret279#1.base, xmalloc_fgetline_#t~ret279#1.offset, xmalloc_fgetline_#t~mem280#1, xmalloc_fgetline_#t~mem281#1, xmalloc_fgetline_#t~mem282#1, xmalloc_fgetline_#t~mem283#1, xmalloc_fgetline_#t~mem284#1, xmalloc_fgetline_~file#1.base, xmalloc_fgetline_~file#1.offset, xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset, xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset;havoc xmalloc_fgetline_#in~file#1.base, xmalloc_fgetline_#in~file#1.offset;assume { :end_inline_xmalloc_fgetline } true;call write~$Pointer$#7(cut_file_#t~ret77#1.base, cut_file_#t~ret77#1.offset, cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8);havoc cut_file_#t~ret77#1.base, cut_file_#t~ret77#1.offset;call cut_file_#t~mem78#1.base, cut_file_#t~mem78#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2684: havoc fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: assume -1 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: assume !(-1 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2685: assume !(fclose_if_not_stdin_~f#1.base == ~stdin~0.base && fclose_if_not_stdin_~f#1.offset == ~stdin~0.offset);assume -2147483648 <= fclose_if_not_stdin_#t~nondet149#1 && fclose_if_not_stdin_#t~nondet149#1 <= 2147483647;fclose_if_not_stdin_~return_value_fclose$1~0#1 := fclose_if_not_stdin_#t~nondet149#1;havoc fclose_if_not_stdin_#t~nondet149#1; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2685: assume !!(fclose_if_not_stdin_~f#1.base == ~stdin~0.base && fclose_if_not_stdin_~f#1.offset == ~stdin~0.offset); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2454: assume !(0 == ~option_mask32~0 % 4 % 4294967296); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2454: assume !!(0 == ~option_mask32~0 % 4 % 4294967296); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214: xmalloc_fgetline_#t~ret279#1.base, xmalloc_fgetline_#t~ret279#1.offset := bb_get_chunk_from_file_#res#1.base, bb_get_chunk_from_file_#res#1.offset;havoc bb_get_chunk_from_file_#t~ret37#1, bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset, bb_get_chunk_from_file_#t~ret39#1.base, bb_get_chunk_from_file_#t~ret39#1.offset, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.offset, bb_get_chunk_from_file_~file#1.base, bb_get_chunk_from_file_~file#1.offset, bb_get_chunk_from_file_~end#1.base, bb_get_chunk_from_file_~end#1.offset, bb_get_chunk_from_file_~ch~0#1, bb_get_chunk_from_file_~idx~0#1, bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset, bb_get_chunk_from_file_~tmp_post$2~0#1;havoc bb_get_chunk_from_file_#in~file#1.base, bb_get_chunk_from_file_#in~file#1.offset, bb_get_chunk_from_file_#in~end#1.base, bb_get_chunk_from_file_#in~end#1.offset;assume { :end_inline_bb_get_chunk_from_file } true;xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset := xmalloc_fgetline_#t~ret279#1.base, xmalloc_fgetline_#t~ret279#1.offset;havoc xmalloc_fgetline_#t~ret279#1.base, xmalloc_fgetline_#t~ret279#1.offset;call xmalloc_fgetline_#t~mem280#1 := read~int#3(xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset, 4); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2488: assume cut_file_~cl_pos~0#1 % 4294967296 >= cut_file_~nlists#1 % 4294967296; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2488: assume !(cut_file_~cl_pos~0#1 % 4294967296 >= cut_file_~nlists#1 % 4294967296);call cut_file_#t~mem92#1 := read~int#7(cut_file_~cut_lists#1.base, cut_file_~cut_lists#1.offset + 8 * (if cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 else cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 4);cut_file_~spos~0#1 := cut_file_#t~mem92#1;havoc cut_file_#t~mem92#1; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2521: assume cut_file_#t~mem102#1.base == 0 && cut_file_#t~mem102#1.offset == 0;havoc cut_file_#t~mem102#1.base, cut_file_#t~mem102#1.offset; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2521: assume !(cut_file_#t~mem102#1.base == 0 && cut_file_#t~mem102#1.offset == 0);havoc cut_file_#t~mem102#1.base, cut_file_#t~mem102#1.offset; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455-1: cut_file_~cl_pos~0#1 := 1 + cut_file_~cl_pos~0#1; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455: assume !(cut_file_~cl_pos~0#1 % 4294967296 >= cut_file_~nlists#1 % 4294967296);call cut_file_#t~mem83#1 := read~int#7(cut_file_~cut_lists#1.base, cut_file_~cut_lists#1.offset + 8 * (if cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 else cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 4);cut_file_~spos~0#1 := cut_file_#t~mem83#1;havoc cut_file_#t~mem83#1; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455: assume !!(cut_file_~cl_pos~0#1 % 4294967296 >= cut_file_~nlists#1 % 4294967296); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2257: assume 0 == bb_get_chunk_from_file_~idx~0#1 % 256 % 4294967296; [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2257: assume !(0 == bb_get_chunk_from_file_~idx~0#1 % 256 % 4294967296); [2025-02-08 13:24:48,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: assume !(0 == xmalloc_fgetline_#t~mem280#1);havoc xmalloc_fgetline_#t~mem280#1;call xmalloc_fgetline_#t~mem281#1 := read~int#3(xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset, 4); [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: assume !!(0 == xmalloc_fgetline_#t~mem280#1);havoc xmalloc_fgetline_#t~mem280#1; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083: assume true;call getopt32_#t~mem236#1 := read~int#15(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083: assume !true; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083-2: assume !!((if getopt32_#t~mem236#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem236#1 % 256 % 4294967296 else getopt32_#t~mem236#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem236#1; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083-2: assume !((if getopt32_#t~mem236#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem236#1 % 256 % 4294967296 else getopt32_#t~mem236#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem236#1;call getopt32_#t~mem237#1 := read~int#15(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: assume 0 == (if getopt32_#t~mem237#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem237#1 % 256 % 4294967296 else getopt32_#t~mem237#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem237#1; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: assume !(0 == (if getopt32_#t~mem237#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem237#1 % 256 % 4294967296 else getopt32_#t~mem237#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem237#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:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688: havoc fclose_if_not_stdin_#t~bitwise150#1; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688-2: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_#t~bitwise150#1;havoc fclose_if_not_stdin_#t~bitwise150#1; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688-4: havoc fclose_if_not_stdin_#t~bitwise150#1;assume (((((fclose_if_not_stdin_~r~0#1 < 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 >= 0) || fclose_if_not_stdin_#t~bitwise150#1 >= fclose_if_not_stdin_~return_value_fclose$1~0#1) && ((fclose_if_not_stdin_~r~0#1 >= 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 < 0) || fclose_if_not_stdin_#t~bitwise150#1 >= fclose_if_not_stdin_~r~0#1)) && ((fclose_if_not_stdin_~r~0#1 < 0 || fclose_if_not_stdin_~return_value_fclose$1~0#1 < 0) || fclose_if_not_stdin_#t~bitwise150#1 <= fclose_if_not_stdin_~r~0#1 + fclose_if_not_stdin_~return_value_fclose$1~0#1)) && ((fclose_if_not_stdin_~r~0#1 >= 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 >= 0) || fclose_if_not_stdin_#t~bitwise150#1 < 0)) && fclose_if_not_stdin_#t~bitwise150#1 <= 2147483647; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2556: assume -2147483648 <= cut_file_#t~nondet111#1 && cut_file_#t~nondet111#1 <= 2147483647;havoc cut_file_#t~nondet111#1;cut_file_~linenum~0#1 := 1 + cut_file_~linenum~0#1;call ULTIMATE.dealloc(cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset);call ULTIMATE.dealloc(cut_file_~orig_line~0#1.base, cut_file_~orig_line~0#1.offset);havoc cut_file_~linelen~0#1, cut_file_~return_value_strlen$1~1#1, cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset, cut_file_~return_value_xzalloc$2~0#1.base, cut_file_~return_value_xzalloc$2~0#1.offset, cut_file_~orig_line~0#1.base, cut_file_~orig_line~0#1.offset, cut_file_~cl_pos~0#1, cut_file_~spos~0#1; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688-3: [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688-6: assume 0 == fclose_if_not_stdin_~r~0#1 || fclose_if_not_stdin_~r~0#1 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise150#1 := fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688-6: assume !(0 == fclose_if_not_stdin_~r~0#1 || fclose_if_not_stdin_~r~0#1 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688-5: assume 0 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise150#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2688-5: assume !(0 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2523: assume cut_file_~ndelim~0#1 >= cut_file_~spos~0#1; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2523: assume !(cut_file_~ndelim~0#1 >= cut_file_~spos~0#1); [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259-1: SUMMARY for call bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset := xrealloc(bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset, (256 + bb_get_chunk_from_file_~idx~0#1) % 4294967296); srcloc: null [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259: bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset := bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset;havoc bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset;bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset := bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217-1: assume xmalloc_fgetline_#t~mem281#1 - 1 >= -2147483648; [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217-1: assume !(xmalloc_fgetline_#t~mem281#1 - 1 >= -2147483648); [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: assume xmalloc_fgetline_#t~mem281#1 - 1 <= 2147483647;call write~int#3(xmalloc_fgetline_#t~mem281#1 - 1, xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset, 4);havoc xmalloc_fgetline_#t~mem281#1;call xmalloc_fgetline_#t~mem282#1 := read~int#3(xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset, 4);call xmalloc_fgetline_#t~mem283#1 := read~int#7(xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset + xmalloc_fgetline_#t~mem282#1, 1); [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: assume !(xmalloc_fgetline_#t~mem281#1 - 1 <= 2147483647); [2025-02-08 13:24:48,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2458: assume !(cut_file_~spos~0#1 >= cut_file_~linelen~0#1);call cut_file_#t~mem84#1 := read~int#7(cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset + cut_file_~spos~0#1, 1); [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2458: assume !!(cut_file_~spos~0#1 >= cut_file_~linelen~0#1); [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2491: assume !((if cut_file_~linenum~0#1 % 4294967296 % 4294967296 <= 2147483647 then cut_file_~linenum~0#1 % 4294967296 % 4294967296 else cut_file_~linenum~0#1 % 4294967296 % 4294967296 - 4294967296) >= cut_file_~spos~0#1); [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2491: assume !!((if cut_file_~linenum~0#1 % 4294967296 % 4294967296 <= 2147483647 then cut_file_~linenum~0#1 % 4294967296 % 4294967296 else cut_file_~linenum~0#1 % 4294967296 % 4294967296 - 4294967296) >= cut_file_~spos~0#1); [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3218: assume 10 == xmalloc_fgetline_#t~mem283#1;havoc xmalloc_fgetline_#t~mem282#1;havoc xmalloc_fgetline_#t~mem283#1;call xmalloc_fgetline_#t~mem284#1 := read~int#3(xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset, 4);call write~int#7(0, xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset + xmalloc_fgetline_#t~mem284#1, 1); [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3218: assume !(10 == xmalloc_fgetline_#t~mem283#1);havoc xmalloc_fgetline_#t~mem282#1;havoc xmalloc_fgetline_#t~mem283#1; [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086: assume 0 != getopt32_#t~bitwise239#1 % 4294967296;havoc getopt32_#t~mem238#1;havoc getopt32_#t~bitwise239#1; [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086: assume !(0 != getopt32_#t~bitwise239#1 % 4294967296);havoc getopt32_#t~mem238#1;havoc getopt32_#t~bitwise239#1;call getopt32_#t~mem240#1 := read~int#15(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem241#1 := read~int#15(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086-2: havoc getopt32_#t~bitwise239#1;assume getopt32_#t~bitwise239#1 % 4294967296 <= getopt32_#t~mem238#1 % 4294967296 && getopt32_#t~bitwise239#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086-1: [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086-4: assume 0 == getopt32_#t~mem238#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise239#1 := 0; [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086-4: assume !(0 == getopt32_#t~mem238#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086-3: assume getopt32_#t~mem238#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise239#1 := getopt32_#t~mem238#1; [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086-3: assume !(getopt32_#t~mem238#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086-5: call getopt32_#t~mem238#1 := read~int#15(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2690-1: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2525-1: SUMMARY for call cut_file_#t~ret103#1.base, cut_file_#t~ret103#1.offset := strsep(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, cut_file_~#delimiter~0#1.base, cut_file_~#delimiter~0#1.offset); srcloc: null [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2525: cut_file_~return_value___strsep_g$7~0#1.base, cut_file_~return_value___strsep_g$7~0#1.offset := cut_file_#t~ret103#1.base, cut_file_#t~ret103#1.offset;havoc cut_file_#t~ret103#1.base, cut_file_#t~ret103#1.offset;cut_file_~tmp_statement_expression$6~0#1.base, cut_file_~tmp_statement_expression$6~0#1.offset := cut_file_~return_value___strsep_g$7~0#1.base, cut_file_~return_value___strsep_g$7~0#1.offset;cut_file_~field~0#1.base, cut_file_~field~0#1.offset := cut_file_~tmp_statement_expression$6~0#1.base, cut_file_~tmp_statement_expression$6~0#1.offset; [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2757: 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:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: assume 0 == cut_file_#t~mem84#1;havoc cut_file_#t~mem84#1;call write~int#7(88, cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset + cut_file_~spos~0#1, 1);call cut_file_#t~mem85#1.base, cut_file_#t~mem85#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8);call cut_file_#t~mem86#1 := read~int#7(cut_file_#t~mem85#1.base, cut_file_#t~mem85#1.offset + cut_file_~spos~0#1, 1);assume -2147483648 <= cut_file_#t~nondet87#1 && cut_file_#t~nondet87#1 <= 2147483647;havoc cut_file_#t~mem85#1.base, cut_file_#t~mem85#1.offset;havoc cut_file_#t~mem86#1;havoc cut_file_#t~nondet87#1; [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: assume !(0 == cut_file_#t~mem84#1);havoc cut_file_#t~mem84#1; [2025-02-08 13:24:48,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2262: bb_get_chunk_from_file_~tmp_post$2~0#1 := bb_get_chunk_from_file_~idx~0#1;bb_get_chunk_from_file_~idx~0#1 := 1 + bb_get_chunk_from_file_~idx~0#1;call write~int#7((if bb_get_chunk_from_file_~ch~0#1 % 256 <= 127 then bb_get_chunk_from_file_~ch~0#1 % 256 else bb_get_chunk_from_file_~ch~0#1 % 256 - 256), bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset + (if bb_get_chunk_from_file_~tmp_post$2~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then bb_get_chunk_from_file_~tmp_post$2~0#1 % 4294967296 % 18446744073709551616 else bb_get_chunk_from_file_~tmp_post$2~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3319: havoc _IO_getc_#t~nondet309#1;bb_get_chunk_from_file_#t~ret37#1 := _IO_getc_#res#1;havoc _IO_getc_#t~nondet309#1, _IO_getc_~stream#1.base, _IO_getc_~stream#1.offset;havoc _IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset;assume { :end_inline__IO_getc } true;assume -2147483648 <= bb_get_chunk_from_file_#t~ret37#1 && bb_get_chunk_from_file_#t~ret37#1 <= 2147483647;bb_get_chunk_from_file_~ch~0#1 := bb_get_chunk_from_file_#t~ret37#1;havoc bb_get_chunk_from_file_#t~ret37#1; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088: getopt32_~trigger~0#1 := getopt32_#t~bitwise242#1;havoc getopt32_#t~mem240#1;havoc getopt32_#t~mem241#1;havoc getopt32_#t~bitwise242#1;call getopt32_#t~mem243#1 := read~int#15(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088-2: havoc getopt32_#t~bitwise242#1;assume getopt32_#t~bitwise242#1 % 4294967296 <= getopt32_#t~mem240#1 % 4294967296 && getopt32_#t~bitwise242#1 % 4294967296 <= getopt32_#t~mem241#1 % 4294967296; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088-1: [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088-4: assume 0 == getopt32_#t~mem240#1 % 4294967296 || 0 == getopt32_#t~mem241#1 % 4294967296;getopt32_#t~bitwise242#1 := 0; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088-4: assume !(0 == getopt32_#t~mem240#1 % 4294967296 || 0 == getopt32_#t~mem241#1 % 4294967296); [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088-3: assume getopt32_#t~mem240#1 % 4294967296 == getopt32_#t~mem241#1 % 4294967296;getopt32_#t~bitwise242#1 := getopt32_#t~mem240#1; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088-3: assume !(getopt32_#t~mem240#1 % 4294967296 == getopt32_#t~mem241#1 % 4294967296); [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3221-1: xmalloc_fgetline_#res#1.base, xmalloc_fgetline_#res#1.offset := xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset;call ULTIMATE.dealloc(xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset);havoc xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: assume true;call llist_add_to_end_#t~mem268#1.base, llist_add_to_end_#t~mem268#1.offset := read~$Pointer$#7(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: assume !true; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-1: [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155-2: assume !!(llist_add_to_end_#t~mem268#1.base == 0 && llist_add_to_end_#t~mem268#1.offset == 0);havoc llist_add_to_end_#t~mem268#1.base, llist_add_to_end_#t~mem268#1.offset; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155-2: assume !(llist_add_to_end_#t~mem268#1.base == 0 && llist_add_to_end_#t~mem268#1.offset == 0);havoc llist_add_to_end_#t~mem268#1.base, llist_add_to_end_#t~mem268#1.offset;call llist_add_to_end_#t~mem269#1.base, llist_add_to_end_#t~mem269#1.offset := read~$Pointer$#7(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~mem269#1.base, llist_add_to_end_#t~mem269#1.offset;havoc llist_add_to_end_#t~mem269#1.base, llist_add_to_end_#t~mem269#1.offset; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089: getopt32_~flags~0#1 := getopt32_#t~bitwise245#1;havoc getopt32_#t~mem243#1;havoc getopt32_#t~bitwise244#1;havoc getopt32_#t~bitwise245#1;call getopt32_#t~mem246#1 := read~int#15(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise244#1) % 4294967296;getopt32_#t~bitwise245#1 := getopt32_~flags~0#1; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise244#1) % 4294967296); [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-2: havoc getopt32_#t~bitwise245#1;assume getopt32_#t~bitwise245#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise245#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise244#1) % 4294967296; [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-5: [2025-02-08 13:24:48,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise244#1) % 4294967296;getopt32_#t~bitwise245#1 := 0; [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise244#1) % 4294967296); [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-7: assume getopt32_#t~mem243#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise244#1 := 0; [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-7: assume !(getopt32_#t~mem243#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-6: havoc getopt32_#t~bitwise244#1;assume getopt32_#t~bitwise244#1 % 4294967296 <= getopt32_#t~mem243#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-9: assume 0 == getopt32_#t~mem243#1 % 4294967296;getopt32_#t~bitwise244#1 := getopt32_~trigger~0#1; [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-9: assume !(0 == getopt32_#t~mem243#1 % 4294967296); [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise244#1 := getopt32_#t~mem243#1; [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528: assume 1 + cut_file_~ndelim~0#1 <= 2147483647;cut_file_~ndelim~0#1 := 1 + cut_file_~ndelim~0#1; [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528: assume !(1 + cut_file_~ndelim~0#1 <= 2147483647); [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528-1: assume 1 + cut_file_~ndelim~0#1 >= -2147483648; [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528-1: assume !(1 + cut_file_~ndelim~0#1 >= -2147483648); [2025-02-08 13:24:48,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2429: call ULTIMATE.dealloc(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset);havoc cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset;havoc cut_file_#t~ret77#1.base, cut_file_#t~ret77#1.offset, cut_file_#t~mem78#1.base, cut_file_#t~mem78#1.offset, cut_file_#t~mem79#1.base, cut_file_#t~mem79#1.offset, cut_file_#t~nondet80#1, cut_file_#t~ret81#1.base, cut_file_#t~ret81#1.offset, cut_file_#t~mem82#1.base, cut_file_#t~mem82#1.offset, cut_file_#t~mem83#1, cut_file_#t~mem84#1, cut_file_#t~mem85#1.base, cut_file_#t~mem85#1.offset, cut_file_#t~mem86#1, cut_file_#t~nondet87#1, cut_file_#t~mem88#1, cut_file_#t~mem89#1, cut_file_#t~mem90#1, cut_file_#t~mem91#1, cut_file_#t~mem92#1, cut_file_#t~ret93#1, cut_file_#t~mem94#1.base, cut_file_#t~mem94#1.offset, cut_file_#t~mem95#1.base, cut_file_#t~mem95#1.offset, cut_file_#t~nondet96#1.base, cut_file_#t~nondet96#1.offset, cut_file_#t~bitwise97#1, cut_file_#t~ret98#1, cut_file_#t~mem99#1.base, cut_file_#t~mem99#1.offset, cut_file_#t~mem100#1.base, cut_file_#t~mem100#1.offset, cut_file_#t~mem101#1, cut_file_#t~mem102#1.base, cut_file_#t~mem102#1.offset, cut_file_#t~ret103#1.base, cut_file_#t~ret103#1.offset, cut_file_#t~mem104#1, cut_file_#t~nondet105#1, cut_file_#t~nondet106#1, cut_file_#t~mem107#1, cut_file_#t~mem108#1.base, cut_file_#t~mem108#1.offset, cut_file_#t~short109#1, cut_file_#t~mem110#1, cut_file_~ndelim~0#1, cut_file_~nfields_printed~0#1, cut_file_~field~0#1.base, cut_file_~field~0#1.offset, cut_file_~#delimiter~0#1.base, cut_file_~#delimiter~0#1.offset, cut_file_~return_value___builtin_strchr$4~0#1.base, cut_file_~return_value___builtin_strchr$4~0#1.offset, cut_file_#t~nondet111#1, cut_file_~linelen~0#1, cut_file_~return_value_strlen$1~1#1, cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset, cut_file_~return_value_xzalloc$2~0#1.base, cut_file_~return_value_xzalloc$2~0#1.offset, cut_file_~orig_line~0#1.base, cut_file_~orig_line~0#1.offset, cut_file_~cl_pos~0#1, cut_file_~spos~0#1, cut_file_~file#1.base, cut_file_~file#1.offset, cut_file_~delim#1, cut_file_~cut_lists#1.base, cut_file_~cut_lists#1.offset, cut_file_~nlists#1, cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, cut_file_~linenum~0#1, cut_file_~tmp_if_expr$3~1#1, cut_file_~tmp_statement_expression$6~0#1.base, cut_file_~tmp_statement_expression$6~0#1.offset, cut_file_~tmp_if_expr$5~0#1, cut_file_~__r0~0#1, cut_file_~__r1~0#1, cut_file_~__r2~0#1, cut_file_~return_value___strsep_g$7~0#1.base, cut_file_~return_value___strsep_g$7~0#1.offset;havoc cut_file_#in~file#1.base, cut_file_#in~file#1.offset, cut_file_#in~delim#1, cut_file_#in~cut_lists#1.base, cut_file_#in~cut_lists#1.offset, cut_file_#in~nlists#1;assume { :end_inline_cut_file } true;assume { :begin_inline_fclose_if_not_stdin } true;fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset := __main_~file~0#1.base, __main_~file~0#1.offset;havoc fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet148#1, fclose_if_not_stdin_#t~nondet149#1, fclose_if_not_stdin_#t~bitwise150#1, fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset, fclose_if_not_stdin_~r~0#1, fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset := fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset;havoc fclose_if_not_stdin_~r~0#1;assume -2147483648 <= fclose_if_not_stdin_#t~nondet148#1 && fclose_if_not_stdin_#t~nondet148#1 <= 2147483647;fclose_if_not_stdin_~r~0#1 := fclose_if_not_stdin_#t~nondet148#1;havoc fclose_if_not_stdin_#t~nondet148#1; [2025-02-08 13:24:48,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090: getopt32_~flags~0#1 := getopt32_#t~bitwise248#1;havoc getopt32_#t~mem246#1;havoc getopt32_#t~bitwise247#1;havoc getopt32_#t~bitwise248#1; [2025-02-08 13:24:48,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-2: havoc getopt32_#t~bitwise248#1;assume (getopt32_#t~bitwise248#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise248#1 % 4294967296 >= getopt32_#t~bitwise247#1 % 4294967296) && getopt32_#t~bitwise248#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise247#1 % 4294967296; [2025-02-08 13:24:48,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-1: [2025-02-08 13:24:48,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise247#1 % 4294967296;getopt32_#t~bitwise248#1 := getopt32_#t~bitwise247#1; [2025-02-08 13:24:48,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise247#1 % 4294967296); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-3: assume 0 == getopt32_#t~bitwise247#1 % 4294967296;getopt32_#t~bitwise248#1 := getopt32_~flags~0#1; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-3: assume !(0 == getopt32_#t~bitwise247#1 % 4294967296); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-6: havoc getopt32_#t~bitwise247#1;assume getopt32_#t~bitwise247#1 % 4294967296 <= getopt32_#t~mem246#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-5: [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise247#1 := getopt32_#t~mem246#1; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-7: assume getopt32_#t~mem246#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise247#1 := 0; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-7: assume !(getopt32_#t~mem246#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-9: assume 0 == getopt32_#t~mem246#1 % 4294967296;getopt32_#t~bitwise247#1 := getopt32_~trigger~0#1; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090-9: assume !(0 == getopt32_#t~mem246#1 % 4294967296); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2661-1: assume !(__main_#t~mem146#1.base == 0 && __main_#t~mem146#1.offset == 0);havoc __main_#t~mem146#1.base, __main_#t~mem146#1.offset; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2661-1: assume !!(__main_#t~mem146#1.base == 0 && __main_#t~mem146#1.offset == 0);havoc __main_#t~mem146#1.base, __main_#t~mem146#1.offset; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265: assume 0 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265: assume !(0 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3157: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091-1: [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091: getopt32_~flags~0#1 := getopt32_#t~bitwise249#1;havoc getopt32_#t~bitwise249#1;call getopt32_#t~mem250#1.base, getopt32_#t~mem250#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise249#1 := 0; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091-2: havoc getopt32_#t~bitwise249#1;assume getopt32_#t~bitwise249#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise249#1 := getopt32_~trigger~0#1; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise249#1 := getopt32_~flags~0#1; [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3091-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3158: 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~ret270#1.base, llist_add_to_end_#t~ret270#1.offset;havoc llist_add_to_end_#t~ret270#1.base, llist_add_to_end_#t~ret270#1.offset;call write~$Pointer$#7(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~mem271#1.base, llist_add_to_end_#t~mem271#1.offset := read~$Pointer$#7(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$#7(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem271#1.base, 8 + llist_add_to_end_#t~mem271#1.offset, 8);havoc llist_add_to_end_#t~mem271#1.base, llist_add_to_end_#t~mem271#1.offset;havoc llist_add_to_end_#t~mem268#1.base, llist_add_to_end_#t~mem268#1.offset, llist_add_to_end_#t~mem269#1.base, llist_add_to_end_#t~mem269#1.offset, llist_add_to_end_#t~ret270#1.base, llist_add_to_end_#t~ret270#1.offset, llist_add_to_end_#t~mem271#1.base, llist_add_to_end_#t~mem271#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:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3092: assume !(getopt32_#t~mem250#1.base == 0 && getopt32_#t~mem250#1.offset == 0);havoc getopt32_#t~mem250#1.base, getopt32_#t~mem250#1.offset;call getopt32_#t~mem251#1.base, getopt32_#t~mem251#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem252#1.base, getopt32_#t~mem252#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem253#1 := read~int#7(getopt32_#t~mem252#1.base, getopt32_#t~mem252#1.offset, 4); [2025-02-08 13:24:48,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3092: assume !!(getopt32_#t~mem250#1.base == 0 && getopt32_#t~mem250#1.offset == 0);havoc getopt32_#t~mem250#1.base, getopt32_#t~mem250#1.offset; [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3158-1: SUMMARY for call llist_add_to_end_#t~ret270#1.base, llist_add_to_end_#t~ret270#1.offset := xzalloc(16); srcloc: null [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: assume !(cut_file_~field~0#1.base == 0 && cut_file_~field~0#1.offset == 0); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: assume !!(cut_file_~field~0#1.base == 0 && cut_file_~field~0#1.offset == 0); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2465-1: assume 1 + cut_file_~spos~0#1 >= -2147483648; [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2465-1: assume !(1 + cut_file_~spos~0#1 >= -2147483648); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2465: assume 1 + cut_file_~spos~0#1 <= 2147483647;cut_file_~spos~0#1 := 1 + cut_file_~spos~0#1;call cut_file_#t~mem88#1 := read~int#7(cut_file_~cut_lists#1.base, 4 + (cut_file_~cut_lists#1.offset + 8 * (if cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 else cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616)), 4); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2465: assume !(1 + cut_file_~spos~0#1 <= 2147483647); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2267: assume !(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2267: assume !!(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3093-1: assume 1 + getopt32_#t~mem253#1 >= -2147483648; [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3093-1: assume !(1 + getopt32_#t~mem253#1 >= -2147483648); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3093: assume 1 + getopt32_#t~mem253#1 <= 2147483647;call write~int#7(1 + getopt32_#t~mem253#1, getopt32_#t~mem251#1.base, getopt32_#t~mem251#1.offset, 4); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3093: assume !(1 + getopt32_#t~mem253#1 <= 2147483647); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730: fopen_or_warn_stdin_#t~ret157#1.base, fopen_or_warn_stdin_#t~ret157#1.offset := fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet154#1.base, fopen_or_warn_#t~nondet154#1.offset, fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset, fopen_or_warn_~mode#1.base, fopen_or_warn_~mode#1.offset, fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset;havoc fopen_or_warn_#in~path#1.base, fopen_or_warn_#in~path#1.offset, fopen_or_warn_#in~mode#1.base, fopen_or_warn_#in~mode#1.offset;assume { :end_inline_fopen_or_warn } true;fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset := fopen_or_warn_stdin_#t~ret157#1.base, fopen_or_warn_stdin_#t~ret157#1.offset; [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2664: __main_#t~ret144#1.base, __main_#t~ret144#1.offset := fopen_or_warn_stdin_#res#1.base, fopen_or_warn_stdin_#res#1.offset;havoc fopen_or_warn_stdin_#t~mem155#1, fopen_or_warn_stdin_#t~mem156#1, fopen_or_warn_stdin_#t~ret157#1.base, fopen_or_warn_stdin_#t~ret157#1.offset, fopen_or_warn_stdin_~filename#1.base, fopen_or_warn_stdin_~filename#1.offset, fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset, fopen_or_warn_stdin_~tmp_if_expr$1~0#1;havoc fopen_or_warn_stdin_#in~filename#1.base, fopen_or_warn_stdin_#in~filename#1.offset;assume { :end_inline_fopen_or_warn_stdin } true;__main_~file~0#1.base, __main_~file~0#1.offset := __main_#t~ret144#1.base, __main_#t~ret144#1.offset;havoc __main_#t~mem143#1.base, __main_#t~mem143#1.offset;havoc __main_#t~ret144#1.base, __main_#t~ret144#1.offset; [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: assume !(cut_file_#t~mem88#1 >= cut_file_~spos~0#1);havoc cut_file_#t~mem88#1; [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: assume !!(cut_file_#t~mem88#1 >= cut_file_~spos~0#1);havoc cut_file_#t~mem88#1; [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem254#1 := read~int#15(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2665: assume __main_~file~0#1.base == 0 && __main_~file~0#1.offset == 0;__main_~retval~0#1 := 1; [2025-02-08 13:24:48,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2665: assume !(__main_~file~0#1.base == 0 && __main_~file~0#1.offset == 0);assume { :begin_inline_cut_file } true;cut_file_#in~file#1.base, cut_file_#in~file#1.offset, cut_file_#in~delim#1, cut_file_#in~cut_lists#1.base, cut_file_#in~cut_lists#1.offset, cut_file_#in~nlists#1 := __main_~file~0#1.base, __main_~file~0#1.offset, __main_~delim~0#1, __main_~cut_lists~0#1.base, __main_~cut_lists~0#1.offset, __main_~nlists~0#1;havoc cut_file_#t~ret77#1.base, cut_file_#t~ret77#1.offset, cut_file_#t~mem78#1.base, cut_file_#t~mem78#1.offset, cut_file_#t~mem79#1.base, cut_file_#t~mem79#1.offset, cut_file_#t~nondet80#1, cut_file_#t~ret81#1.base, cut_file_#t~ret81#1.offset, cut_file_#t~mem82#1.base, cut_file_#t~mem82#1.offset, cut_file_#t~mem83#1, cut_file_#t~mem84#1, cut_file_#t~mem85#1.base, cut_file_#t~mem85#1.offset, cut_file_#t~mem86#1, cut_file_#t~nondet87#1, cut_file_#t~mem88#1, cut_file_#t~mem89#1, cut_file_#t~mem90#1, cut_file_#t~mem91#1, cut_file_#t~mem92#1, cut_file_#t~ret93#1, cut_file_#t~mem94#1.base, cut_file_#t~mem94#1.offset, cut_file_#t~mem95#1.base, cut_file_#t~mem95#1.offset, cut_file_#t~nondet96#1.base, cut_file_#t~nondet96#1.offset, cut_file_#t~bitwise97#1, cut_file_#t~ret98#1, cut_file_#t~mem99#1.base, cut_file_#t~mem99#1.offset, cut_file_#t~mem100#1.base, cut_file_#t~mem100#1.offset, cut_file_#t~mem101#1, cut_file_#t~mem102#1.base, cut_file_#t~mem102#1.offset, cut_file_#t~ret103#1.base, cut_file_#t~ret103#1.offset, cut_file_#t~mem104#1, cut_file_#t~nondet105#1, cut_file_#t~nondet106#1, cut_file_#t~mem107#1, cut_file_#t~mem108#1.base, cut_file_#t~mem108#1.offset, cut_file_#t~short109#1, cut_file_#t~mem110#1, cut_file_~ndelim~0#1, cut_file_~nfields_printed~0#1, cut_file_~field~0#1.base, cut_file_~field~0#1.offset, cut_file_~#delimiter~0#1.base, cut_file_~#delimiter~0#1.offset, cut_file_~return_value___builtin_strchr$4~0#1.base, cut_file_~return_value___builtin_strchr$4~0#1.offset, cut_file_#t~nondet111#1, cut_file_~linelen~0#1, cut_file_~return_value_strlen$1~1#1, cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset, cut_file_~return_value_xzalloc$2~0#1.base, cut_file_~return_value_xzalloc$2~0#1.offset, cut_file_~orig_line~0#1.base, cut_file_~orig_line~0#1.offset, cut_file_~cl_pos~0#1, cut_file_~spos~0#1, cut_file_~file#1.base, cut_file_~file#1.offset, cut_file_~delim#1, cut_file_~cut_lists#1.base, cut_file_~cut_lists#1.offset, cut_file_~nlists#1, cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, cut_file_~linenum~0#1, cut_file_~tmp_if_expr$3~1#1, cut_file_~tmp_statement_expression$6~0#1.base, cut_file_~tmp_statement_expression$6~0#1.offset, cut_file_~tmp_if_expr$5~0#1, cut_file_~__r0~0#1, cut_file_~__r1~0#1, cut_file_~__r2~0#1, cut_file_~return_value___strsep_g$7~0#1.base, cut_file_~return_value___strsep_g$7~0#1.offset;cut_file_~file#1.base, cut_file_~file#1.offset := cut_file_#in~file#1.base, cut_file_#in~file#1.offset;cut_file_~delim#1 := cut_file_#in~delim#1;cut_file_~cut_lists#1.base, cut_file_~cut_lists#1.offset := cut_file_#in~cut_lists#1.base, cut_file_#in~cut_lists#1.offset;cut_file_~nlists#1 := cut_file_#in~nlists#1;call cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset := #Ultimate.allocOnStack(8);cut_file_~linenum~0#1 := 0;havoc cut_file_~tmp_if_expr$3~1#1;havoc cut_file_~tmp_statement_expression$6~0#1.base, cut_file_~tmp_statement_expression$6~0#1.offset;havoc cut_file_~tmp_if_expr$5~0#1;havoc cut_file_~__r0~0#1;havoc cut_file_~__r1~0#1;havoc cut_file_~__r2~0#1;havoc cut_file_~return_value___strsep_g$7~0#1.base, cut_file_~return_value___strsep_g$7~0#1.offset; [2025-02-08 13:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2533: assume cut_file_~ndelim~0#1 == cut_file_~spos~0#1;call cut_file_#t~mem104#1 := read~int#7(cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset + cut_file_~ndelim~0#1, 1); [2025-02-08 13:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2533: assume !(cut_file_~ndelim~0#1 == cut_file_~spos~0#1); [2025-02-08 13:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2269: assume 10 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2269: assume !(10 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3096: assume 1 == getopt32_#t~mem254#1;havoc getopt32_#t~mem254#1;call getopt32_#t~mem255#1.base, getopt32_#t~mem255#1.offset := read~$Pointer$#15(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~mem255#1.base, getopt32_#t~mem255#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem268#1.base, llist_add_to_end_#t~mem268#1.offset, llist_add_to_end_#t~mem269#1.base, llist_add_to_end_#t~mem269#1.offset, llist_add_to_end_#t~ret270#1.base, llist_add_to_end_#t~ret270#1.offset, llist_add_to_end_#t~mem271#1.base, llist_add_to_end_#t~mem271#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:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3096: assume !(1 == getopt32_#t~mem254#1);havoc getopt32_#t~mem254#1;call getopt32_#t~mem256#1 := read~int#15(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535: assume 0 == cut_file_#t~mem104#1;havoc cut_file_#t~mem104#1; [2025-02-08 13:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535: assume !(0 == cut_file_#t~mem104#1);havoc cut_file_#t~mem104#1; [2025-02-08 13:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2503: call ULTIMATE.dealloc(cut_file_~#delimiter~0#1.base, cut_file_~#delimiter~0#1.offset);havoc cut_file_~#delimiter~0#1.base, cut_file_~#delimiter~0#1.offset;havoc cut_file_~ndelim~0#1, cut_file_~nfields_printed~0#1, cut_file_~field~0#1.base, cut_file_~field~0#1.offset, cut_file_~#delimiter~0#1.base, cut_file_~#delimiter~0#1.offset, cut_file_~return_value___builtin_strchr$4~0#1.base, cut_file_~return_value___builtin_strchr$4~0#1.offset; [2025-02-08 13:24:48,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2537: assume cut_file_~nfields_printed~0#1 > 0;assume -2147483648 <= cut_file_#t~nondet105#1 && cut_file_#t~nondet105#1 <= 2147483647; [2025-02-08 13:24:48,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2537: assume !(cut_file_~nfields_printed~0#1 > 0); [2025-02-08 13:24:48,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: assume true;assume { :begin_inline_xmalloc_fgetline } true;xmalloc_fgetline_#in~file#1.base, xmalloc_fgetline_#in~file#1.offset := cut_file_~file#1.base, cut_file_~file#1.offset;havoc xmalloc_fgetline_#res#1.base, xmalloc_fgetline_#res#1.offset;havoc xmalloc_fgetline_#t~ret279#1.base, xmalloc_fgetline_#t~ret279#1.offset, xmalloc_fgetline_#t~mem280#1, xmalloc_fgetline_#t~mem281#1, xmalloc_fgetline_#t~mem282#1, xmalloc_fgetline_#t~mem283#1, xmalloc_fgetline_#t~mem284#1, xmalloc_fgetline_~file#1.base, xmalloc_fgetline_~file#1.offset, xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset, xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset;xmalloc_fgetline_~file#1.base, xmalloc_fgetline_~file#1.offset := xmalloc_fgetline_#in~file#1.base, xmalloc_fgetline_#in~file#1.offset;call xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset := #Ultimate.allocOnStack(4);havoc xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset;assume { :begin_inline_bb_get_chunk_from_file } true;bb_get_chunk_from_file_#in~file#1.base, bb_get_chunk_from_file_#in~file#1.offset, bb_get_chunk_from_file_#in~end#1.base, bb_get_chunk_from_file_#in~end#1.offset := xmalloc_fgetline_~file#1.base, xmalloc_fgetline_~file#1.offset, xmalloc_fgetline_~#i~1#1.base, xmalloc_fgetline_~#i~1#1.offset;havoc bb_get_chunk_from_file_#res#1.base, bb_get_chunk_from_file_#res#1.offset;havoc bb_get_chunk_from_file_#t~ret37#1, bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset, bb_get_chunk_from_file_#t~ret39#1.base, bb_get_chunk_from_file_#t~ret39#1.offset, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.offset, bb_get_chunk_from_file_~file#1.base, bb_get_chunk_from_file_~file#1.offset, bb_get_chunk_from_file_~end#1.base, bb_get_chunk_from_file_~end#1.offset, bb_get_chunk_from_file_~ch~0#1, bb_get_chunk_from_file_~idx~0#1, bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset, bb_get_chunk_from_file_~tmp_post$2~0#1;bb_get_chunk_from_file_~file#1.base, bb_get_chunk_from_file_~file#1.offset := bb_get_chunk_from_file_#in~file#1.base, bb_get_chunk_from_file_#in~file#1.offset;bb_get_chunk_from_file_~end#1.base, bb_get_chunk_from_file_~end#1.offset := bb_get_chunk_from_file_#in~end#1.base, bb_get_chunk_from_file_#in~end#1.offset;havoc bb_get_chunk_from_file_~ch~0#1;bb_get_chunk_from_file_~idx~0#1 := 0;bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset := 0, 0;havoc bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset;havoc bb_get_chunk_from_file_~tmp_post$2~0#1; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: assume !true; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2471: assume 10 == cut_file_~delim#1;call cut_file_#t~mem89#1 := read~int#7(cut_file_~cut_lists#1.base, cut_file_~cut_lists#1.offset + 8 * (if cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 else cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 4);cut_file_~spos~0#1 := cut_file_#t~mem89#1;havoc cut_file_#t~mem89#1; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2471: assume !(10 == cut_file_~delim#1);cut_file_~ndelim~0#1 := -1;cut_file_~nfields_printed~0#1 := 0;cut_file_~field~0#1.base, cut_file_~field~0#1.offset := 0, 0;call cut_file_~#delimiter~0#1.base, cut_file_~#delimiter~0#1.offset := #Ultimate.allocOnStack(2);call write~int#21(cut_file_~delim#1, cut_file_~#delimiter~0#1.base, cut_file_~#delimiter~0#1.offset, 1);call write~int#21(0, cut_file_~#delimiter~0#1.base, 1 + cut_file_~#delimiter~0#1.offset, 1);havoc cut_file_~return_value___builtin_strchr$4~0#1.base, cut_file_~return_value___builtin_strchr$4~0#1.offset;call cut_file_#t~mem95#1.base, cut_file_#t~mem95#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8);assume (0 == cut_file_#t~nondet96#1.base && 0 == cut_file_#t~nondet96#1.offset) || (cut_file_#t~nondet96#1.base == cut_file_#t~mem95#1.base && 0 <= cut_file_#t~nondet96#1.offset && cut_file_#t~nondet96#1.offset <= #length[cut_file_#t~mem95#1.base]);cut_file_~return_value___builtin_strchr$4~0#1.base, cut_file_~return_value___builtin_strchr$4~0#1.offset := cut_file_#t~nondet96#1.base, cut_file_#t~nondet96#1.offset;havoc cut_file_#t~mem95#1.base, cut_file_#t~mem95#1.offset;havoc cut_file_#t~nondet96#1.base, cut_file_#t~nondet96#1.offset; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-1: assume true; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-1: assume !true; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3099: assume 2 == getopt32_#t~mem256#1;havoc getopt32_#t~mem256#1;havoc getopt32_~return_value_xatoi_positive$13~0#1; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3099: assume !(2 == getopt32_#t~mem256#1);havoc getopt32_#t~mem256#1;call getopt32_#t~mem259#1.base, getopt32_#t~mem259#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2670: __main_#t~ret145#1 := fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet148#1, fclose_if_not_stdin_#t~nondet149#1, fclose_if_not_stdin_#t~bitwise150#1, fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset, fclose_if_not_stdin_~r~0#1, fclose_if_not_stdin_~return_value_fclose$1~0#1;havoc fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset;assume { :end_inline_fclose_if_not_stdin } true;assume -2147483648 <= __main_#t~ret145#1 && __main_#t~ret145#1 <= 2147483647;havoc __main_#t~ret145#1; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2274: assume !(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0);call write~int#3((if bb_get_chunk_from_file_~idx~0#1 % 4294967296 % 4294967296 <= 2147483647 then bb_get_chunk_from_file_~idx~0#1 % 4294967296 % 4294967296 else bb_get_chunk_from_file_~idx~0#1 % 4294967296 % 4294967296 - 4294967296), bb_get_chunk_from_file_~end#1.base, bb_get_chunk_from_file_~end#1.offset, 4); [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2274: assume !!(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0); [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539-1: assume false; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539-1: assume !false; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539: assume true; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539: assume !true;havoc cut_file_#t~nondet106#1;call write~int#7(88, cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset + cut_file_~ndelim~0#1, 1); [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2672: __main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;havoc __main_~file~0#1.base, __main_~file~0#1.offset;call __main_#t~mem146#1.base, __main_#t~mem146#1.offset := read~$Pointer$#9(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: call ULTIMATE.dealloc(__main_~#sopt~0#1.base, __main_~#sopt~0#1.offset);havoc __main_~#sopt~0#1.base, __main_~#sopt~0#1.offset;call ULTIMATE.dealloc(__main_~#ltok~0#1.base, __main_~#ltok~0#1.offset);havoc __main_~#ltok~0#1.base, __main_~#ltok~0#1.offset; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2474: assume cut_file_~cl_pos~0#1 % 4294967296 >= cut_file_~nlists#1 % 4294967296 || !((if cut_file_~linenum~0#1 % 4294967296 % 4294967296 <= 2147483647 then cut_file_~linenum~0#1 % 4294967296 % 4294967296 else cut_file_~linenum~0#1 % 4294967296 % 4294967296 - 4294967296) >= cut_file_~spos~0#1); [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2474: assume !(cut_file_~cl_pos~0#1 % 4294967296 >= cut_file_~nlists#1 % 4294967296 || !((if cut_file_~linenum~0#1 % 4294967296 % 4294967296 <= 2147483647 then cut_file_~linenum~0#1 % 4294967296 % 4294967296 else cut_file_~linenum~0#1 % 4294967296 % 4294967296 - 4294967296) >= cut_file_~spos~0#1)); [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2441: assume cut_file_#t~mem78#1.base == 0 && cut_file_#t~mem78#1.offset == 0;havoc cut_file_#t~mem78#1.base, cut_file_#t~mem78#1.offset; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2441: assume !(cut_file_#t~mem78#1.base == 0 && cut_file_#t~mem78#1.offset == 0);havoc cut_file_#t~mem78#1.base, cut_file_#t~mem78#1.offset; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276: assume !(bb_get_chunk_from_file_~linebuf~0#1.base == 0 && bb_get_chunk_from_file_~linebuf~0#1.offset == 0);havoc bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.offset; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2276: assume !!(bb_get_chunk_from_file_~linebuf~0#1.base == 0 && bb_get_chunk_from_file_~linebuf~0#1.offset == 0); [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102: assume -2147483648 <= getopt32_#t~ret257#1 && getopt32_#t~ret257#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret257#1;havoc getopt32_#t~ret257#1;call getopt32_#t~mem258#1.base, getopt32_#t~mem258#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int#7(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem258#1.base, getopt32_#t~mem258#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem258#1.base, getopt32_#t~mem258#1.offset; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102-1: SUMMARY for call getopt32_#t~ret257#1 := xatoi_positive(~optarg~0.base, ~optarg~0.offset); srcloc: null [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2541-1: assume 1 + cut_file_~nfields_printed~0#1 >= -2147483648; [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2541-1: assume !(1 + cut_file_~nfields_printed~0#1 >= -2147483648); [2025-02-08 13:24:48,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508: assume cut_file_~return_value___builtin_strchr$4~0#1.base == 0 && cut_file_~return_value___builtin_strchr$4~0#1.offset == 0; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508: assume !(cut_file_~return_value___builtin_strchr$4~0#1.base == 0 && cut_file_~return_value___builtin_strchr$4~0#1.offset == 0); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2541: assume 1 + cut_file_~nfields_printed~0#1 <= 2147483647;cut_file_~nfields_printed~0#1 := 1 + cut_file_~nfields_printed~0#1; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2541: assume !(1 + cut_file_~nfields_printed~0#1 <= 2147483647); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume !(cut_file_~spos~0#1 >= (if cut_file_~linenum~0#1 % 4294967296 % 4294967296 <= 2147483647 then cut_file_~linenum~0#1 % 4294967296 % 4294967296 else cut_file_~linenum~0#1 % 4294967296 % 4294967296 - 4294967296)); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume !!(cut_file_~spos~0#1 >= (if cut_file_~linenum~0#1 % 4294967296 % 4294967296 <= 2147483647 then cut_file_~linenum~0#1 % 4294967296 % 4294967296 else cut_file_~linenum~0#1 % 4294967296 % 4294967296 - 4294967296));havoc cut_file_#t~ret93#1;call cut_file_#t~mem94#1.base, cut_file_#t~mem94#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8);havoc cut_file_#t~ret93#1;havoc cut_file_#t~mem94#1.base, cut_file_#t~mem94#1.offset; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc cut_file_~linelen~0#1;havoc cut_file_~return_value_strlen$1~1#1;call cut_file_#t~mem79#1.base, cut_file_#t~mem79#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8);cut_file_~return_value_strlen$1~1#1 := cut_file_#t~nondet80#1;havoc cut_file_#t~mem79#1.base, cut_file_#t~mem79#1.offset;havoc cut_file_#t~nondet80#1;cut_file_~linelen~0#1 := (if cut_file_~return_value_strlen$1~1#1 % 18446744073709551616 % 4294967296 <= 2147483647 then cut_file_~return_value_strlen$1~1#1 % 18446744073709551616 % 4294967296 else cut_file_~return_value_strlen$1~1#1 % 18446744073709551616 % 4294967296 - 4294967296);havoc cut_file_~printed~0#1.base, cut_file_~printed~0#1.offset;havoc cut_file_~return_value_xzalloc$2~0#1.base, cut_file_~return_value_xzalloc$2~0#1.offset; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2510: assume 0 == cut_file_#t~bitwise97#1 % 4294967296;havoc cut_file_#t~bitwise97#1;havoc cut_file_#t~ret98#1;call cut_file_#t~mem99#1.base, cut_file_#t~mem99#1.offset := read~$Pointer$#7(cut_file_~#line~0#1.base, cut_file_~#line~0#1.offset, 8); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2510: assume !(0 == cut_file_#t~bitwise97#1 % 4294967296);havoc cut_file_#t~bitwise97#1; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2510-2: havoc cut_file_#t~bitwise97#1;assume cut_file_#t~bitwise97#1 % 4294967296 <= 16 && cut_file_#t~bitwise97#1 % 4294967296 <= ~option_mask32~0 % 4294967296; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2510-1: [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2510-4: assume 0 == ~option_mask32~0 % 4294967296;cut_file_#t~bitwise97#1 := 0; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2510-4: assume !(0 == ~option_mask32~0 % 4294967296); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2510-3: assume 16 == ~option_mask32~0 % 4294967296;cut_file_#t~bitwise97#1 := 16; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2510-3: assume !(16 == ~option_mask32~0 % 4294967296); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2279-1: SUMMARY for call bb_get_chunk_from_file_#t~ret39#1.base, bb_get_chunk_from_file_#t~ret39#1.offset := xrealloc(bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset, (1 + bb_get_chunk_from_file_~idx~0#1) % 4294967296); srcloc: null [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2279: bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.offset := bb_get_chunk_from_file_#t~ret39#1.base, bb_get_chunk_from_file_#t~ret39#1.offset;havoc bb_get_chunk_from_file_#t~ret39#1.base, bb_get_chunk_from_file_#t~ret39#1.offset;bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset := bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.offset;call write~int#7(0, bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset + (if bb_get_chunk_from_file_~idx~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then bb_get_chunk_from_file_~idx~0#1 % 4294967296 % 18446744073709551616 else bb_get_chunk_from_file_~idx~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);havoc bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.offset; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: assume 1 + cut_file_~spos~0#1 <= 2147483647;cut_file_~spos~0#1 := 1 + cut_file_~spos~0#1;call cut_file_#t~mem90#1 := read~int#7(cut_file_~cut_lists#1.base, 4 + (cut_file_~cut_lists#1.offset + 8 * (if cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 else cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616)), 4); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: assume !(1 + cut_file_~spos~0#1 <= 2147483647); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478-1: assume 1 + cut_file_~spos~0#1 >= -2147483648; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478-1: assume !(1 + cut_file_~spos~0#1 >= -2147483648); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106: assume !(getopt32_#t~mem259#1.base == 0 && getopt32_#t~mem259#1.offset == 0);havoc getopt32_#t~mem259#1.base, getopt32_#t~mem259#1.offset;call getopt32_#t~mem260#1.base, getopt32_#t~mem260#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$#7(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem260#1.base, getopt32_#t~mem260#1.offset, 8); [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106: assume !!(getopt32_#t~mem259#1.base == 0 && getopt32_#t~mem259#1.offset == 0);havoc getopt32_#t~mem259#1.base, getopt32_#t~mem259#1.offset; [2025-02-08 13:24:48,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2644: __main_#t~ret139#1.base, __main_#t~ret139#1.offset := xrealloc_vector_helper_#res#1.base, xrealloc_vector_helper_#res#1.offset;havoc xrealloc_vector_helper_#t~bitwise287#1, xrealloc_vector_helper_#t~bitwise288#1, xrealloc_vector_helper_#t~ret289#1.base, xrealloc_vector_helper_#t~ret289#1.offset, xrealloc_vector_helper_#t~memset~res290#1.base, xrealloc_vector_helper_#t~memset~res290#1.offset, xrealloc_vector_helper_~vector#1.base, xrealloc_vector_helper_~vector#1.offset, xrealloc_vector_helper_~sizeof_and_shift#1, xrealloc_vector_helper_~idx#1, xrealloc_vector_helper_~mask~0#1;havoc xrealloc_vector_helper_#in~vector#1.base, xrealloc_vector_helper_#in~vector#1.offset, xrealloc_vector_helper_#in~sizeof_and_shift#1, xrealloc_vector_helper_#in~idx#1;assume { :end_inline_xrealloc_vector_helper } true;__main_~return_value_xrealloc_vector_helper$11~0#1.base, __main_~return_value_xrealloc_vector_helper$11~0#1.offset := __main_#t~ret139#1.base, __main_#t~ret139#1.offset;havoc __main_#t~ret139#1.base, __main_#t~ret139#1.offset;__main_~cut_lists~0#1.base, __main_~cut_lists~0#1.offset := __main_~return_value_xrealloc_vector_helper$11~0#1.base, __main_~return_value_xrealloc_vector_helper$11~0#1.offset;call write~int#7(__main_~s~0#1, __main_~cut_lists~0#1.base, __main_~cut_lists~0#1.offset + 8 * (if __main_~nlists~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~nlists~0#1 % 4294967296 % 18446744073709551616 else __main_~nlists~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 4);call write~int#7(__main_~e~0#1, __main_~cut_lists~0#1.base, 4 + (__main_~cut_lists~0#1.offset + 8 * (if __main_~nlists~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then __main_~nlists~0#1 % 4294967296 % 18446744073709551616 else __main_~nlists~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616)), 4);__main_~nlists~0#1 := 1 + __main_~nlists~0#1;havoc __main_~return_value_xrealloc_vector_helper$11~0#1.base, __main_~return_value_xrealloc_vector_helper$11~0#1.offset; [2025-02-08 13:24:48,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545-1: assume 1 + cut_file_~spos~0#1 >= -2147483648; [2025-02-08 13:24:48,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545-1: assume !(1 + cut_file_~spos~0#1 >= -2147483648); [2025-02-08 13:24:48,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: assume 1 + cut_file_~spos~0#1 <= 2147483647;cut_file_~spos~0#1 := 1 + cut_file_~spos~0#1;call cut_file_#t~mem107#1 := read~int#7(cut_file_~cut_lists#1.base, 4 + (cut_file_~cut_lists#1.offset + 8 * (if cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 else cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616)), 4);cut_file_#t~short109#1 := cut_file_#t~mem107#1 >= cut_file_~spos~0#1; [2025-02-08 13:24:48,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: assume !(1 + cut_file_~spos~0#1 <= 2147483647); [2025-02-08 13:24:48,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: assume !(cut_file_#t~mem90#1 >= cut_file_~spos~0#1);havoc cut_file_#t~mem90#1;cut_file_~tmp_if_expr$3~1#1 := 1; [2025-02-08 13:24:48,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: assume !!(cut_file_#t~mem90#1 >= cut_file_~spos~0#1);havoc cut_file_#t~mem90#1;call cut_file_#t~mem91#1 := read~int#7(cut_file_~cut_lists#1.base, 4 + (cut_file_~cut_lists#1.offset + 8 * (if cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 else cut_file_~cl_pos~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616)), 4);cut_file_~tmp_if_expr$3~1#1 := (if 0 == (if 0 != (if -1 == cut_file_#t~mem91#1 then 1 else 0) then 1 else 0) then 0 else 1);havoc cut_file_#t~mem91#1; [2025-02-08 13:24:48,210 INFO L? ?]: Removed 726 outVars from TransFormulas that were not future-live. [2025-02-08 13:24:48,210 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:24:48,248 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:24:48,253 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:24:48,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:24:48 BoogieIcfgContainer [2025-02-08 13:24:48,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:24:48,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:24:48,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:24:48,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:24:48,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:24:39" (1/3) ... [2025-02-08 13:24:48,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa8d399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:24:48, skipping insertion in model container [2025-02-08 13:24:48,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41" (2/3) ... [2025-02-08 13:24:48,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa8d399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:24:48, skipping insertion in model container [2025-02-08 13:24:48,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:24:48" (3/3) ... [2025-02-08 13:24:48,261 INFO L128 eAbstractionObserver]: Analyzing ICFG cut-3.i [2025-02-08 13:24:48,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:24:48,277 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cut-3.i that has 75 procedures, 755 locations, 1 initial locations, 82 loop locations, and 91 error locations. [2025-02-08 13:24:48,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:24:48,344 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;@43cb61f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:24:48,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2025-02-08 13:24:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 517 states, 380 states have (on average 1.6789473684210525) internal successors, (638), 479 states have internal predecessors, (638), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-08 13:24:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:24:48,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:48,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:24:48,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:24:48,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1462657, now seen corresponding path program 1 times [2025-02-08 13:24:48,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:48,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251808997] [2025-02-08 13:24:48,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:49,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:24:49,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:24:49,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:49,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:49,857 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:24:49,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:49,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251808997] [2025-02-08 13:24:49,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251808997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:49,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:49,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:24:49,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491416400] [2025-02-08 13:24:49,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:49,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:49,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:49,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:49,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:49,880 INFO L87 Difference]: Start difference. First operand has 517 states, 380 states have (on average 1.6789473684210525) internal successors, (638), 479 states have internal predecessors, (638), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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:24:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:50,074 INFO L93 Difference]: Finished difference Result 727 states and 987 transitions. [2025-02-08 13:24:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:50,080 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:24:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:50,085 INFO L225 Difference]: With dead ends: 727 [2025-02-08 13:24:50,086 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:24:50,093 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:24:50,096 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:50,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 518 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:24:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:24:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:24:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 152 states have (on average 1.5263157894736843) internal successors, (232), 185 states have internal predecessors, (232), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:24:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2025-02-08 13:24:50,136 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 3 [2025-02-08 13:24:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:50,136 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2025-02-08 13:24:50,137 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:24:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2025-02-08 13:24:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:24:50,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:50,137 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:24:50,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:24:50,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:24:50,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:50,138 INFO L85 PathProgramCache]: Analyzing trace with hash 625739997, now seen corresponding path program 1 times [2025-02-08 13:24:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:50,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125089200] [2025-02-08 13:24:50,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:50,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:50,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:24:50,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:24:50,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:50,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:51,227 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:24:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:51,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125089200] [2025-02-08 13:24:51,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125089200] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:51,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141053362] [2025-02-08 13:24:51,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:51,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:51,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:51,231 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:24:51,232 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:24:52,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:24:52,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:24:52,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:52,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:52,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 1942 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:24:52,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:24:52,658 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:24:52,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:24:52,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141053362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:52,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:24:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:24:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537982850] [2025-02-08 13:24:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:52,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:24:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:52,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:24:52,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:24:52,660 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:24:56,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:24:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:56,885 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2025-02-08 13:24:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:24:56,885 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:24:56,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:56,886 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:24:56,886 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:24:56,886 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:24:56,887 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:56,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 700 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:24:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:24:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 13:24:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 152 states have (on average 1.519736842105263) internal successors, (231), 184 states have internal predecessors, (231), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:24:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2025-02-08 13:24:56,895 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 6 [2025-02-08 13:24:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:56,896 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2025-02-08 13:24:56,896 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:24:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2025-02-08 13:24:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:24:56,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:56,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:24:56,907 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:24:57,096 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:24:57,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:24:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2076895165, now seen corresponding path program 1 times [2025-02-08 13:24:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:57,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437617412] [2025-02-08 13:24:57,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:57,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:24:57,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:24:57,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:57,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:57,895 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:24:57,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437617412] [2025-02-08 13:24:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437617412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:24:57,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:24:57,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:24:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496492086] [2025-02-08 13:24:57,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:24:57,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:24:57,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:24:57,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:24:57,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:24:57,896 INFO L87 Difference]: Start difference. First operand 198 states and 246 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:24:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:24:58,012 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-02-08 13:24:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:24:58,013 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:24:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:24:58,014 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:24:58,014 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 13:24:58,014 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:24:58,014 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:24:58,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 468 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:24:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 13:24:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-02-08 13:24:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.52) internal successors, (228), 181 states have internal predecessors, (228), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:24:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-08 13:24:58,027 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 7 [2025-02-08 13:24:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:24:58,027 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-08 13:24:58,027 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:24:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-08 13:24:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:24:58,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:24:58,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:24:58,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:24:58,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:24:58,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:24:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash -816690942, now seen corresponding path program 1 times [2025-02-08 13:24:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:24:58,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348730695] [2025-02-08 13:24:58,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:24:58,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:24:58,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:24:58,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:24:58,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:24:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:24:59,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:24:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348730695] [2025-02-08 13:24:59,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348730695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:24:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860467861] [2025-02-08 13:24:59,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:24:59,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:24:59,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:59,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:24:59,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:25:00,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:25:00,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:25:00,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:00,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:00,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1959 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:25:00,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:25:00,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860467861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:00,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:00,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:25:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412990681] [2025-02-08 13:25:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:00,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:00,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:00,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:00,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:00,276 INFO L87 Difference]: Start difference. First operand 195 states and 243 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:04,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:04,549 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2025-02-08 13:25:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:04,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:25:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:04,550 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:25:04,550 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:25:04,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:04,551 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 187 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:04,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 271 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-08 13:25:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:25:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-08 13:25:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 179 states have internal predecessors, (226), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2025-02-08 13:25:04,561 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 11 [2025-02-08 13:25:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:04,562 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2025-02-08 13:25:04,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2025-02-08 13:25:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:25:04,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:04,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:04,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:04,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:04,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:04,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash 452385976, now seen corresponding path program 1 times [2025-02-08 13:25:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:04,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027583046] [2025-02-08 13:25:04,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:05,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:25:05,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:25:05,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:05,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:05,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027583046] [2025-02-08 13:25:05,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027583046] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:05,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552058238] [2025-02-08 13:25:05,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:05,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:05,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:05,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:05,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:25:06,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:25:06,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:25:06,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:06,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:06,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1960 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:06,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:07,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552058238] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:07,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:07,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:25:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518145957] [2025-02-08 13:25:07,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:07,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:07,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:07,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:07,202 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:25:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:07,424 INFO L93 Difference]: Finished difference Result 390 states and 488 transitions. [2025-02-08 13:25:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:25:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:07,426 INFO L225 Difference]: With dead ends: 390 [2025-02-08 13:25:07,426 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 13:25:07,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:07,427 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:07,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 695 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:25:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 13:25:07,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 13:25:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 188 states have internal predecessors, (235), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2025-02-08 13:25:07,443 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 250 transitions. Word has length 12 [2025-02-08 13:25:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:07,443 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 250 transitions. [2025-02-08 13:25:07,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:25:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2025-02-08 13:25:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:25:07,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:07,444 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:07,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:25:07,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:07,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:07,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash 709255004, now seen corresponding path program 2 times [2025-02-08 13:25:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973748408] [2025-02-08 13:25:07,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:25:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:08,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:25:08,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:25:08,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:25:08,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973748408] [2025-02-08 13:25:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973748408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:08,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:08,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:25:08,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140975051] [2025-02-08 13:25:08,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:08,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:25:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:08,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:25:08,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:08,889 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:12,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:13,253 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2025-02-08 13:25:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:25:13,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:25:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:13,255 INFO L225 Difference]: With dead ends: 202 [2025-02-08 13:25:13,255 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 13:25:13,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:13,255 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 186 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:13,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 710 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-08 13:25:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 13:25:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-08 13:25:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.4654088050314464) internal successors, (233), 186 states have internal predecessors, (233), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2025-02-08 13:25:13,264 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 21 [2025-02-08 13:25:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:13,264 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2025-02-08 13:25:13,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2025-02-08 13:25:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:25:13,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:13,265 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:13,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:25:13,265 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:13,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:13,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1518079257, now seen corresponding path program 1 times [2025-02-08 13:25:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:13,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729407802] [2025-02-08 13:25:13,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:13,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:13,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:25:13,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:25:13,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:13,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:14,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:14,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729407802] [2025-02-08 13:25:14,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729407802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:14,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:14,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358874947] [2025-02-08 13:25:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:14,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:14,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:14,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:14,119 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:18,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:18,287 INFO L93 Difference]: Finished difference Result 384 states and 481 transitions. [2025-02-08 13:25:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:18,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:25:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:18,288 INFO L225 Difference]: With dead ends: 384 [2025-02-08 13:25:18,288 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 13:25:18,289 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:25:18,289 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:18,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 457 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:25:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 13:25:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 13:25:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.4567901234567902) internal successors, (236), 189 states have internal predecessors, (236), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2025-02-08 13:25:18,295 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 26 [2025-02-08 13:25:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:18,295 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2025-02-08 13:25:18,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2025-02-08 13:25:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 13:25:18,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:18,296 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:18,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:25:18,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:18,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash -184521514, now seen corresponding path program 1 times [2025-02-08 13:25:18,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:18,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443618534] [2025-02-08 13:25:18,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:18,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 13:25:18,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 13:25:18,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:18,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:19,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443618534] [2025-02-08 13:25:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443618534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:19,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887005790] [2025-02-08 13:25:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:19,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:19,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:19,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:19,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:19,118 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:19,264 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2025-02-08 13:25:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:19,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-08 13:25:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:19,266 INFO L225 Difference]: With dead ends: 320 [2025-02-08 13:25:19,267 INFO L226 Difference]: Without dead ends: 318 [2025-02-08 13:25:19,267 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:25:19,267 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 140 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:19,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 457 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:25:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-08 13:25:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 207. [2025-02-08 13:25:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 166 states have (on average 1.4518072289156627) internal successors, (241), 193 states have internal predecessors, (241), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 256 transitions. [2025-02-08 13:25:19,276 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 256 transitions. Word has length 27 [2025-02-08 13:25:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:19,277 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 256 transitions. [2025-02-08 13:25:19,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2025-02-08 13:25:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:25:19,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:19,277 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:19,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:25:19,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:19,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash -905099211, now seen corresponding path program 1 times [2025-02-08 13:25:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985122432] [2025-02-08 13:25:19,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:19,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:25:19,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:25:19,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:19,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:20,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:20,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985122432] [2025-02-08 13:25:20,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985122432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:20,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103189031] [2025-02-08 13:25:20,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:20,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:20,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:20,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:20,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:25:21,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:25:21,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:25:21,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:21,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:21,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 2149 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:25:21,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:25:22,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:25:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103189031] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:22,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:22,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:25:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612683131] [2025-02-08 13:25:22,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:22,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:25:22,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:22,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:25:22,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:25:22,909 INFO L87 Difference]: Start difference. First operand 207 states and 256 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:25:26,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:30,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:31,764 INFO L93 Difference]: Finished difference Result 417 states and 521 transitions. [2025-02-08 13:25:31,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:25:31,765 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:25:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:31,766 INFO L225 Difference]: With dead ends: 417 [2025-02-08 13:25:31,766 INFO L226 Difference]: Without dead ends: 224 [2025-02-08 13:25:31,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:25:31,768 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 5 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:31,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1340 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2025-02-08 13:25:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-08 13:25:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-02-08 13:25:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 210 states have internal predecessors, (258), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 273 transitions. [2025-02-08 13:25:31,775 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 273 transitions. Word has length 29 [2025-02-08 13:25:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:31,776 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 273 transitions. [2025-02-08 13:25:31,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:25:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 273 transitions. [2025-02-08 13:25:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:25:31,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:31,778 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:31,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:25:31,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 13:25:31,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:31,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1041850603, now seen corresponding path program 1 times [2025-02-08 13:25:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:31,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185826498] [2025-02-08 13:25:31,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:32,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:25:32,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:25:32,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:32,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:25:32,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:32,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185826498] [2025-02-08 13:25:32,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185826498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:32,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:32,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:32,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216700605] [2025-02-08 13:25:32,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:32,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:32,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:32,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:32,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:32,780 INFO L87 Difference]: Start difference. First operand 224 states and 273 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:36,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:37,066 INFO L93 Difference]: Finished difference Result 236 states and 287 transitions. [2025-02-08 13:25:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:37,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-08 13:25:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:37,068 INFO L225 Difference]: With dead ends: 236 [2025-02-08 13:25:37,068 INFO L226 Difference]: Without dead ends: 234 [2025-02-08 13:25:37,068 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:25:37,068 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:37,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 452 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-08 13:25:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-08 13:25:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2025-02-08 13:25:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 193 states have (on average 1.3989637305699483) internal successors, (270), 219 states have internal predecessors, (270), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2025-02-08 13:25:37,074 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 47 [2025-02-08 13:25:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:37,074 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2025-02-08 13:25:37,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2025-02-08 13:25:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:25:37,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:37,078 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:37,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:25:37,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:37,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:37,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2062376027, now seen corresponding path program 1 times [2025-02-08 13:25:37,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:37,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480048580] [2025-02-08 13:25:37,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:37,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:37,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:25:37,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:25:37,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:37,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:25:37,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:37,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480048580] [2025-02-08 13:25:37,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480048580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:37,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:37,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:37,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302884669] [2025-02-08 13:25:37,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:37,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:37,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:37,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:37,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:37,854 INFO L87 Difference]: Start difference. First operand 233 states and 285 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:41,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:42,053 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2025-02-08 13:25:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:25:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:42,058 INFO L225 Difference]: With dead ends: 233 [2025-02-08 13:25:42,058 INFO L226 Difference]: Without dead ends: 232 [2025-02-08 13:25:42,058 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:25:42,059 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:42,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 455 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:25:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-08 13:25:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2025-02-08 13:25:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 214 states have internal predecessors, (264), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 279 transitions. [2025-02-08 13:25:42,069 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 279 transitions. Word has length 48 [2025-02-08 13:25:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:42,069 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 279 transitions. [2025-02-08 13:25:42,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 279 transitions. [2025-02-08 13:25:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:25:42,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:42,069 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:42,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:25:42,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:42,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash -602216230, now seen corresponding path program 1 times [2025-02-08 13:25:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:42,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426647147] [2025-02-08 13:25:42,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:42,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:25:42,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:25:42,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:42,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:42,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426647147] [2025-02-08 13:25:42,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426647147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:42,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372065181] [2025-02-08 13:25:42,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:42,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:42,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:42,982 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:42,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:25:44,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:25:44,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:25:44,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:44,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:44,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 2333 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:44,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:44,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:44,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372065181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:44,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:44,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:25:44,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776938145] [2025-02-08 13:25:44,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:44,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:25:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:44,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:25:44,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:44,483 INFO L87 Difference]: Start difference. First operand 228 states and 279 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:44,727 INFO L93 Difference]: Finished difference Result 339 states and 427 transitions. [2025-02-08 13:25:44,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:25:44,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-08 13:25:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:44,729 INFO L225 Difference]: With dead ends: 339 [2025-02-08 13:25:44,729 INFO L226 Difference]: Without dead ends: 338 [2025-02-08 13:25:44,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:25:44,730 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 279 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:44,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 597 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:25:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-08 13:25:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 227. [2025-02-08 13:25:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 189 states have (on average 1.3915343915343916) internal successors, (263), 213 states have internal predecessors, (263), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2025-02-08 13:25:44,737 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 49 [2025-02-08 13:25:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:44,737 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2025-02-08 13:25:44,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2025-02-08 13:25:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:25:44,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:44,739 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:44,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:44,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 13:25:44,940 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:44,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1488832568, now seen corresponding path program 1 times [2025-02-08 13:25:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:44,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061230502] [2025-02-08 13:25:44,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:45,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:25:45,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:25:45,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:45,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061230502] [2025-02-08 13:25:45,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061230502] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541794827] [2025-02-08 13:25:45,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:45,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:45,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:45,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:25:47,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:25:47,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:25:47,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:47,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:47,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 2334 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:47,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:47,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:25:47,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541794827] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:47,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:47,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:25:47,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326342264] [2025-02-08 13:25:47,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:47,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:47,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:47,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:47,757 INFO L87 Difference]: Start difference. First operand 227 states and 278 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:48,246 INFO L93 Difference]: Finished difference Result 684 states and 888 transitions. [2025-02-08 13:25:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:48,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-08 13:25:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:48,249 INFO L225 Difference]: With dead ends: 684 [2025-02-08 13:25:48,249 INFO L226 Difference]: Without dead ends: 683 [2025-02-08 13:25:48,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:48,250 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 836 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:48,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1078 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:25:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-02-08 13:25:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 239. [2025-02-08 13:25:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 225 states have internal predecessors, (278), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 293 transitions. [2025-02-08 13:25:48,258 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 293 transitions. Word has length 50 [2025-02-08 13:25:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:48,259 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 293 transitions. [2025-02-08 13:25:48,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 293 transitions. [2025-02-08 13:25:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:25:48,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:48,259 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:48,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:48,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:25:48,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:25:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 173884465, now seen corresponding path program 1 times [2025-02-08 13:25:48,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:48,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933117131] [2025-02-08 13:25:48,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:48,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:49,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:25:49,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:25:49,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:49,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:25:49,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933117131] [2025-02-08 13:25:49,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933117131] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293229357] [2025-02-08 13:25:49,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:49,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:49,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:49,355 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:49,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:25:50,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:25:50,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:25:50,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:50,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:50,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 2322 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:50,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:25:50,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:25:51,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293229357] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:51,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:51,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:25:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621503023] [2025-02-08 13:25:51,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:51,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:51,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:51,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:51,129 INFO L87 Difference]: Start difference. First operand 239 states and 293 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:55,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:59,202 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:26:03,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:07,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:11,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:11,629 INFO L93 Difference]: Finished difference Result 454 states and 564 transitions. [2025-02-08 13:26:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 13:26:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:11,630 INFO L225 Difference]: With dead ends: 454 [2025-02-08 13:26:11,630 INFO L226 Difference]: Without dead ends: 257 [2025-02-08 13:26:11,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:11,631 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 4 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:11,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 903 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 20.5s Time] [2025-02-08 13:26:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-08 13:26:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-02-08 13:26:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 219 states have (on average 1.3515981735159817) internal successors, (296), 243 states have internal predecessors, (296), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2025-02-08 13:26:11,638 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 54 [2025-02-08 13:26:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:11,638 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2025-02-08 13:26:11,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2025-02-08 13:26:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 13:26:11,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:11,639 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:11,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:26:11,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:11,839 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [xatoi_positiveErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, xatoi_positiveErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 88 more)] === [2025-02-08 13:26:11,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash 823137777, now seen corresponding path program 1 times [2025-02-08 13:26:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:11,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176883136] [2025-02-08 13:26:11,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:11,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:12,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 13:26:12,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 13:26:12,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:12,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:26:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:13,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176883136] [2025-02-08 13:26:13,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176883136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:13,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:13,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:26:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039257523] [2025-02-08 13:26:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:13,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:26:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:13,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:26:13,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:13,530 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)