./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/printf-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:42:33,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:42:33,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:42:33,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:42:33,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:42:33,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:42:33,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:42:33,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:42:33,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:42:33,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:42:33,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:42:33,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:42:33,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:42:33,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:42:33,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:42:33,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:42:33,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:33,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:42:33,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:42:33,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:42:33,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:42:33,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:42:33,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:42:33,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:42:33,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:42:33,908 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-02-08 07:42:34,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:42:34,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:42:34,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:42:34,154 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:42:34,154 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:42:34,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-02-08 07:42:35,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40a3c975e/e532815cfd57406c8bb23280e49003e4/FLAGb0394ec77 [2025-02-08 07:42:35,710 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:42:35,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-02-08 07:42:35,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40a3c975e/e532815cfd57406c8bb23280e49003e4/FLAGb0394ec77 [2025-02-08 07:42:35,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40a3c975e/e532815cfd57406c8bb23280e49003e4 [2025-02-08 07:42:35,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:42:35,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:42:35,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:35,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:42:35,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:42:35,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:35" (1/1) ... [2025-02-08 07:42:35,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7afcc142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:35, skipping insertion in model container [2025-02-08 07:42:35,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:35" (1/1) ... [2025-02-08 07:42:35,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:42:36,631 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,632 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,641 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,643 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,649 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,650 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,651 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,652 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,652 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,652 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,660 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,660 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,661 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,662 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,663 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,663 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,668 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,669 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,669 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,669 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,670 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,670 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,670 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,672 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,674 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,675 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,679 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,682 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,682 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,683 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,685 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,686 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,687 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,688 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,689 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,691 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,692 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,693 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,695 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,697 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,697 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,697 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,698 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,698 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,698 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,702 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,703 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,703 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,704 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,706 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,708 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,708 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,708 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,709 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,709 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,710 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,719 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,720 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,724 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,733 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,744 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:36,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:36,795 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:42:36,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:37,061 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 07:42:37,069 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:42:37,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37 WrapperNode [2025-02-08 07:42:37,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:37,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:37,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:42:37,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:42:37,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,216 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1858 [2025-02-08 07:42:37,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:37,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:42:37,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:42:37,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:42:37,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,249 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 07:42:37,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:42:37,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:42:37,342 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:42:37,342 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:42:37,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (1/1) ... [2025-02-08 07:42:37,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:37,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:37,371 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 07:42:37,381 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 07:42:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-08 07:42:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-02-08 07:42:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-02-08 07:42:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:42:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-08 07:42:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-02-08 07:42:37,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-02-08 07:42:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 07:42:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 07:42:37,402 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 07:42:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 07:42:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 07:42:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-02-08 07:42:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-02-08 07:42:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-08 07:42:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:42:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:42:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 07:42:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:42:37,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:42:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 07:42:37,404 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 07:42:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 07:42:37,404 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 07:42:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 07:42:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 07:42:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-02-08 07:42:37,405 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-02-08 07:42:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-02-08 07:42:37,405 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-02-08 07:42:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:42:37,405 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:42:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-02-08 07:42:37,405 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-02-08 07:42:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:42:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 07:42:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 07:42:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-02-08 07:42:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-02-08 07:42:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 07:42:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-02-08 07:42:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-02-08 07:42:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-02-08 07:42:37,406 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-02-08 07:42:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-02-08 07:42:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 07:42:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-02-08 07:42:37,407 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-02-08 07:42:37,760 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:42:37,769 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:42:37,925 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-02-08 07:42:38,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678: assume -9223372036854775808 <= conv_strtoull_#t~ret142#1 && conv_strtoull_#t~ret142#1 <= 9223372036854775807;conv_strtoull_~return_value_bb_strtoll$1~0#1 := conv_strtoull_#t~ret142#1;havoc conv_strtoull_#t~ret142#1; [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678-1: SUMMARY for call conv_strtoull_#t~ret142#1 := bb_strtoll(conv_strtoull_~arg#1.base, conv_strtoull_~arg#1.offset, 0, 0, 0); srcloc: null [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset;conv_strtoull_#t~ret140#1 := bb_strtoull_#res#1;havoc bb_strtoull_#t~mem103#1, bb_strtoull_#t~ret104#1, bb_strtoull_#t~ret105#1, bb_strtoull_#t~nondet106#1, bb_strtoull_#t~ret107#1, bb_strtoull_~arg#1.base, bb_strtoull_~arg#1.offset, bb_strtoull_~endp#1.base, bb_strtoull_~endp#1.offset, bb_strtoull_~base#1, bb_strtoull_~v~2#1, bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset, bb_strtoull_~return_value_bb_ascii_isalnum$2~0#1, bb_strtoull_~return_value_ret_ERANGE$1~0#1, bb_strtoull_~return_value_handle_errors$3~0#1;havoc bb_strtoull_#in~arg#1.base, bb_strtoull_#in~arg#1.offset, bb_strtoull_#in~endp#1.base, bb_strtoull_#in~endp#1.offset, bb_strtoull_#in~base#1;assume { :end_inline_bb_strtoull } true; [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3257: utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset := utoa_to_buf_#res#1.base, utoa_to_buf_#res#1.offset;havoc utoa_to_buf_~n#1, utoa_to_buf_~buf#1.base, utoa_to_buf_~buf#1.offset, utoa_to_buf_~buflen#1, utoa_to_buf_~i~0#1, utoa_to_buf_~out~0#1, utoa_to_buf_~res~0#1, utoa_to_buf_~tmp_post$1~1#1.base, utoa_to_buf_~tmp_post$1~1#1.offset;havoc utoa_to_buf_#in~n#1, utoa_to_buf_#in~buf#1.base, utoa_to_buf_#in~buf#1.offset, utoa_to_buf_#in~buflen#1;assume { :end_inline_utoa_to_buf } true;utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset := utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset;havoc utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset; [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679: assume !(conv_strtoull_~result#1.base == 0 && conv_strtoull_~result#1.offset == 0); [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679: assume !!(conv_strtoull_~result#1.base == 0 && conv_strtoull_~result#1.offset == 0); [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754: #t~ret156#1.base, #t~ret156#1.offset := utoa_#res#1.base, utoa_#res#1.offset;havoc utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset, utoa_~n#1, utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset;havoc utoa_#in~n#1;assume { :end_inline_utoa } true;~arg#1.base, ~arg#1.offset := #t~ret156#1.base, #t~ret156#1.offset;havoc #t~mem155#1;havoc #t~ret156#1.base, #t~ret156#1.offset; [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3258: utoa_#res#1.base, utoa_#res#1.offset := ~#local_buf~0.base, ~#local_buf~0.offset; [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3258-1: SUMMARY for call write~int(0, utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset, 1); srcloc: null [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3258-1: assume !(1 == #valid[utoa_~return_value_utoa_to_buf$1~0#1.base]); [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3258-1: assume !(1 + utoa_~return_value_utoa_to_buf$1~0#1.offset <= #length[utoa_~return_value_utoa_to_buf$1~0#1.base] && 0 <= utoa_~return_value_utoa_to_buf$1~0#1.offset); [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2682: SUMMARY for call reach_error(); srcloc: null [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2674: havoc conv_strtoull_#t~ret140#1; [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2674-1: SUMMARY for call write~int(conv_strtoull_#t~ret140#1, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset, 8); srcloc: null [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2674-1: assume !(1 == #valid[conv_strtoull_~result#1.base]); [2025-02-08 07:42:38,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2674-1: assume !(8 + conv_strtoull_~result#1.offset <= #length[conv_strtoull_~result#1.base] && 0 <= conv_strtoull_~result#1.offset); [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: havoc conv_strtoull_#t~ret140#1, conv_strtoull_#t~mem141#1, conv_strtoull_#t~ret142#1, conv_strtoull_~return_value_bb_strtoll$1~0#1, conv_strtoull_~arg#1.base, conv_strtoull_~arg#1.offset, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset;havoc conv_strtoull_#in~arg#1.base, conv_strtoull_#in~arg#1.offset, conv_strtoull_#in~result#1.base, conv_strtoull_#in~result#1.offset;assume { :end_inline_conv_strtoull } true; [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2683-1: SUMMARY for call write~int(conv_strtoull_~return_value_bb_strtoll$1~0#1, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset, 8); srcloc: null [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2683-1: assume !(1 == #valid[conv_strtoull_~result#1.base]); [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2683-1: assume !(8 + conv_strtoull_~result#1.offset <= #length[conv_strtoull_~result#1.base] && 0 <= conv_strtoull_~result#1.offset); [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2683: havoc conv_strtoull_~return_value_bb_strtoll$1~0#1; [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675-1: SUMMARY for call conv_strtoull_#t~mem141#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: assume !(0 == conv_strtoull_#t~mem141#1);havoc conv_strtoull_#t~mem141#1;havoc conv_strtoull_~return_value_bb_strtoll$1~0#1; [2025-02-08 07:42:38,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: assume !!(0 == conv_strtoull_#t~mem141#1);havoc conv_strtoull_#t~mem141#1; [2025-02-08 07:42:38,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: assume ~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: assume !(~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0); [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret214#1; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret215#1; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779-1: SUMMARY for call my_xstrtoll_#t~ret163#1 := multiconvert(my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, #funAddr~conv_strtoll.base, #funAddr~conv_strtoll.offset); srcloc: null [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: assume -2147483648 <= my_xstrtoll_#t~ret163#1 && my_xstrtoll_#t~ret163#1 <= 2147483647;my_xstrtoll_~return_value_multiconvert$1~0#1 := my_xstrtoll_#t~ret163#1;havoc my_xstrtoll_#t~ret163#1; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret206#1; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret207#1; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume !(0 == my_xstrtoll_~return_value_multiconvert$1~0#1); [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume !!(0 == my_xstrtoll_~return_value_multiconvert$1~0#1); [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781: SUMMARY for call write~int(0, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, 8); srcloc: null [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781: assume !(1 == #valid[my_xstrtoll_~#result~1#1.base]); [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781: assume !(8 + my_xstrtoll_~#result~1#1.offset <= #length[my_xstrtoll_~#result~1#1.base] && 0 <= my_xstrtoll_~#result~1#1.offset); [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2980: ~llv~0#1 := ~argument#1.base + ~argument#1.offset; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset;#t~ret205#1 := my_xstrtoll_#res#1;havoc my_xstrtoll_#t~ret163#1, my_xstrtoll_#t~mem164#1, my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, my_xstrtoll_~return_value_multiconvert$1~0#1;havoc my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset;assume { :end_inline_my_xstrtoll } true;assume -9223372036854775808 <= #t~ret205#1 && #t~ret205#1 <= 9223372036854775807;~llv~0#1 := #t~ret205#1;havoc #t~ret205#1; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782-2: my_xstrtoll_#res#1 := my_xstrtoll_#t~mem164#1;havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782-3: SUMMARY for call my_xstrtoll_#t~mem164#1 := read~int(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, 8); srcloc: null [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782-3: assume !(1 == #valid[my_xstrtoll_~#result~1#1.base]); [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782-3: assume !(8 + my_xstrtoll_~#result~1#1.offset <= #length[my_xstrtoll_~#result~1#1.base] && 0 <= my_xstrtoll_~#result~1#1.offset); [2025-02-08 07:42:38,487 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret208#1; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret209#1; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume { :begin_inline_my_xstrtod } true;my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtod_#res#1;havoc my_xstrtod_#t~ret161#1, my_xstrtod_#t~mem162#1, my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset := my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset;call my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset := #Ultimate.allocOnStack(8); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2985: assume ~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2985: assume !(~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: assume -2147483648 <= my_xstrtoull_#t~ret165#1 && my_xstrtoull_#t~ret165#1 <= 2147483647;my_xstrtoull_~return_value_multiconvert$1~1#1 := my_xstrtoull_#t~ret165#1;havoc my_xstrtoull_#t~ret165#1; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788-1: SUMMARY for call my_xstrtoull_#t~ret165#1 := multiconvert(my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, #funAddr~conv_strtoull.base, #funAddr~conv_strtoull.offset); srcloc: null [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772: assume -2147483648 <= my_xstrtod_#t~ret161#1 && my_xstrtod_#t~ret161#1 <= 2147483647;havoc my_xstrtod_#t~ret161#1; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772-1: SUMMARY for call my_xstrtod_#t~ret161#1 := multiconvert(my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset, #funAddr~conv_strtod.base, #funAddr~conv_strtod.offset); srcloc: null [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret212#1; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret213#1; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2789: assume !(0 == my_xstrtoull_~return_value_multiconvert$1~1#1); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2789: assume !!(0 == my_xstrtoull_~return_value_multiconvert$1~1#1); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;#t~ret211#1 := my_xstrtod_#res#1;havoc my_xstrtod_#t~ret161#1, my_xstrtod_#t~mem162#1, my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;havoc my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset;assume { :end_inline_my_xstrtod } true;~dv~0#1 := #t~ret211#1;havoc #t~ret211#1; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-3: SUMMARY for call my_xstrtod_#t~mem162#1 := read~real(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset, 8); srcloc: null [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-3: assume !(1 == #valid[my_xstrtod_~#result~0#1.base]); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-3: assume !(8 + my_xstrtod_~#result~0#1.offset <= #length[my_xstrtod_~#result~0#1.base] && 0 <= my_xstrtod_~#result~0#1.offset); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773-2: my_xstrtod_#res#1 := my_xstrtod_#t~mem162#1;havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2790: SUMMARY for call write~int(0, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, 8); srcloc: null [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2790: assume !(1 == #valid[my_xstrtoull_~#result~2#1.base]); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2790: assume !(8 + my_xstrtoull_~#result~2#1.offset <= #length[my_xstrtoull_~#result~2#1.base] && 0 <= my_xstrtoull_~#result~2#1.offset); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: assume { :begin_inline_my_xstrtoll } true;my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtoll_#res#1;havoc my_xstrtoll_#t~ret163#1, my_xstrtoll_#t~mem164#1, my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, my_xstrtoll_~return_value_multiconvert$1~0#1;my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset := my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset;call my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset := #Ultimate.allocOnStack(8);havoc my_xstrtoll_~return_value_multiconvert$1~0#1; [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset;#t~ret210#1 := my_xstrtoull_#res#1;havoc my_xstrtoull_#t~ret165#1, my_xstrtoull_#t~mem166#1, my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, my_xstrtoull_~return_value_multiconvert$1~1#1;havoc my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset;assume { :end_inline_my_xstrtoull } true;~return_value_my_xstrtoull$2~0#1 := #t~ret210#1;havoc #t~ret210#1;~llv~0#1 := (if ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 else ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791-3: SUMMARY for call my_xstrtoull_#t~mem166#1 := read~int(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, 8); srcloc: null [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791-3: assume !(1 == #valid[my_xstrtoull_~#result~2#1.base]); [2025-02-08 07:42:38,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791-3: assume !(8 + my_xstrtoull_~#result~2#1.offset <= #length[my_xstrtoull_~#result~2#1.base] && 0 <= my_xstrtoull_~#result~2#1.offset); [2025-02-08 07:42:38,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791-2: my_xstrtoull_#res#1 := my_xstrtoull_#t~mem166#1;havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-02-08 07:42:38,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: havoc ~return_value_my_xstrtoull$2~0#1;assume { :begin_inline_my_xstrtoull } true;my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtoull_#res#1;havoc my_xstrtoull_#t~ret165#1, my_xstrtoull_#t~mem166#1, my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, my_xstrtoull_~return_value_multiconvert$1~1#1;my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset := my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset;call my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset := #Ultimate.allocOnStack(8);havoc my_xstrtoull_~return_value_multiconvert$1~1#1; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret314#1, safe_write_#t~mem315#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~4#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~1#1;havoc safe_write_~tmp_if_expr$1~4#1; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698: full_write_#t~ret144#1 := safe_write_#res#1;havoc safe_write_#t~ret314#1, safe_write_#t~mem315#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~4#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret144#1 && full_write_#t~ret144#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret144#1;havoc full_write_#t~ret144#1; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243-1: assume 0 != safe_write_~tmp_if_expr$1~4#1 % 256; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243-1: assume !(0 != safe_write_~tmp_if_expr$1~4#1 % 256); [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet355#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet355#1;assume -9223372036854775808 <= write_#t~nondet355#1 && write_#t~nondet355#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet355#1;havoc write_#t~nondet355#1; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: assume !true; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3252-1: safe_write_#res#1 := safe_write_~n~1#1; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: assume full_write_~cc~0#1 < 0; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: assume !(full_write_~cc~0#1 < 0);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 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3245: safe_write_#t~ret314#1 := write_#res#1;havoc write_#t~nondet355#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret314#1 && safe_write_#t~ret314#1 <= 9223372036854775807;safe_write_~n~1#1 := safe_write_#t~ret314#1;havoc safe_write_#t~ret314#1; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394: write_#res#1 := write_~ret~1#1; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: assume safe_write_~n~1#1 < 0; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: assume !(safe_write_~n~1#1 < 0);safe_write_~tmp_if_expr$1~4#1 := 0; [2025-02-08 07:42:38,684 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2701: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2701: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2635: #t~ret129#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet143#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret129#1 && #t~ret129#1 <= 2147483647;havoc #t~ret129#1; [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247-1: SUMMARY for call safe_write_#t~mem315#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247: safe_write_~tmp_if_expr$1~4#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem315#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636: #t~ret131#1 := full_write_#res#1;havoc full_write_#t~ret144#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= #t~ret131#1 && #t~ret131#1 <= 9223372036854775807;havoc #t~mem130#1.base, #t~mem130#1.offset;havoc #t~ret131#1; [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636-2: SUMMARY for call #t~mem130#1.base, #t~mem130#1.offset := read~$Pointer$(~#msg~0#1.base, ~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636-2: assume !(1 == #valid[~#msg~0#1.base]); [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636-2: assume !(8 + ~#msg~0#1.offset <= #length[~#msg~0#1.base] && 0 <= ~#msg~0#1.offset); [2025-02-08 07:42:38,685 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636-1: assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, #t~mem130#1.base, #t~mem130#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret144#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 07:42:43,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174: havoc print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset; [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-2: SUMMARY for call print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8); srcloc: null [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-2: assume !(1 == #valid[print_formatted_~#f#1.base]); [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-2: assume !(8 + print_formatted_~#f#1.offset <= #length[print_formatted_~#f#1.base] && 0 <= print_formatted_~#f#1.offset); [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-1: SUMMARY for call write~$Pointer$(print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset - 1, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8); srcloc: null [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-1: assume !(1 == #valid[print_formatted_~#f#1.base]); [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3174-1: assume !(8 + print_formatted_~#f#1.offset <= #length[print_formatted_~#f#1.base] && 0 <= print_formatted_~#f#1.offset); [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset := xmalloc_#res#1.base, xmalloc_#res#1.offset;havoc xmalloc_#t~malloc318#1.base, xmalloc_#t~malloc318#1.offset, xmalloc_#t~varargs319#1.base, xmalloc_#t~varargs319#1.offset, xmalloc_~size#1, xmalloc_~ptr~0#1.base, xmalloc_~ptr~0#1.offset;havoc xmalloc_#in~size#1;assume { :end_inline_xmalloc } true;print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset := print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset;havoc print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset;print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset := print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset;assume { :begin_inline_#Ultimate.C_memcpy } true;#Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset, #Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset, #Ultimate.C_memcpy_size#1 := print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset, print_formatted_~direc_length~0#1 % 4294967296; [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148: havoc print_formatted_#t~mem282#1; [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148-2: SUMMARY for call print_formatted_#t~mem282#1 := read~int(print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); srcloc: null [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148-2: assume !(1 == #valid[print_formatted_~p~3#1.base]); [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148-2: assume !(1 + (print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616)) <= #length[print_formatted_~p~3#1.base] && 0 <= print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616)); [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148-1: SUMMARY for call write~int(print_formatted_#t~mem282#1, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 else (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); srcloc: null [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148-1: assume !(1 == #valid[print_formatted_~p~3#1.base]); [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3148-1: assume !(1 + (print_formatted_~p~3#1.offset + (if (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 else (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 - 18446744073709551616)) <= #length[print_formatted_~p~3#1.base] && 0 <= print_formatted_~p~3#1.offset + (if (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 else (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 - 18446744073709551616)); [2025-02-08 07:42:43,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-02-08 07:42:43,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3149: SUMMARY for call write~int(108, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); srcloc: null [2025-02-08 07:42:43,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3149: assume !(1 == #valid[print_formatted_~p~3#1.base]); [2025-02-08 07:42:43,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3149: assume !(1 + (print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616)) <= #length[print_formatted_~p~3#1.base] && 0 <= print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616)); [2025-02-08 07:42:43,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: print_formatted_~direc_length~0#1 := 2 + print_formatted_~direc_length~0#1;print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset := print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset;havoc print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset; [2025-02-08 07:42:43,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150-1: SUMMARY for call write~int(108, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 else print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); srcloc: null [2025-02-08 07:42:43,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150-1: assume !(1 == #valid[print_formatted_~p~3#1.base]); [2025-02-08 07:42:43,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150-1: assume !(1 + (print_formatted_~p~3#1.offset + (if print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 else print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616)) <= #length[print_formatted_~p~3#1.base] && 0 <= print_formatted_~p~3#1.offset + (if print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 else print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616)); [2025-02-08 07:42:43,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220-1: assume 0 != __main_~tmp_if_expr$2~1#1 % 256; [2025-02-08 07:42:43,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220-1: assume !(0 != __main_~tmp_if_expr$2~1#1 % 256); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume !(__main_~argv#1.base == __main_~argv2~0#1.base && __main_~argv#1.offset >= __main_~argv2~0#1.offset); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume !!(__main_~argv#1.base == __main_~argv2~0#1.base && __main_~argv#1.offset >= __main_~argv2~0#1.offset);__main_~tmp_if_expr$2~1#1 := 0; [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset;__main_#t~ret310#1.base, __main_#t~ret310#1.offset := print_formatted_#res#1.base, print_formatted_#res#1.offset;havoc print_formatted_#t~mem222#1.base, print_formatted_#t~mem222#1.offset, print_formatted_#t~mem223#1, print_formatted_#t~mem224#1.base, print_formatted_#t~mem224#1.offset, print_formatted_#t~mem225#1, print_formatted_#t~mem226#1.base, print_formatted_#t~mem226#1.offset, print_formatted_#t~mem227#1, print_formatted_#t~mem228#1.base, print_formatted_#t~mem228#1.offset, print_formatted_#t~mem229#1.base, print_formatted_#t~mem229#1.offset, print_formatted_#t~mem230#1.base, print_formatted_#t~mem230#1.offset, print_formatted_#t~mem231#1, print_formatted_#t~ret232#1, print_formatted_#t~mem233#1.base, print_formatted_#t~mem233#1.offset, print_formatted_#t~mem234#1, print_formatted_#t~mem235#1.base, print_formatted_#t~mem235#1.offset, print_formatted_#t~mem236#1.base, print_formatted_#t~mem236#1.offset, print_formatted_#t~mem237#1.base, print_formatted_#t~mem237#1.offset, print_formatted_#t~mem238#1, print_formatted_#t~nondet239#1.base, print_formatted_#t~nondet239#1.offset, print_formatted_#t~mem240#1.base, print_formatted_#t~mem240#1.offset, print_formatted_#t~mem241#1, print_formatted_#t~mem242#1.base, print_formatted_#t~mem242#1.offset, print_formatted_#t~mem243#1.base, print_formatted_#t~mem243#1.offset, print_formatted_#t~mem244#1, print_formatted_#t~mem245#1.base, print_formatted_#t~mem245#1.offset, print_formatted_#t~mem246#1.base, print_formatted_#t~mem246#1.offset, print_formatted_#t~mem247#1.base, print_formatted_#t~mem247#1.offset, print_formatted_#t~ret248#1, print_formatted_#t~mem249#1.base, print_formatted_#t~mem249#1.offset, print_formatted_#t~mem250#1, print_formatted_#t~mem251#1.base, print_formatted_#t~mem251#1.offset, print_formatted_#t~mem252#1.base, print_formatted_#t~mem252#1.offset, print_formatted_#t~mem253#1, print_formatted_#t~mem254#1.base, print_formatted_#t~mem254#1.offset, print_formatted_#t~mem255#1.base, print_formatted_#t~mem255#1.offset, print_formatted_#t~mem256#1, print_formatted_#t~mem257#1.base, print_formatted_#t~mem257#1.offset, print_formatted_#t~mem258#1.base, print_formatted_#t~mem258#1.offset, print_formatted_#t~mem259#1.base, print_formatted_#t~mem259#1.offset, print_formatted_#t~ret260#1, print_formatted_#t~mem261#1.base, print_formatted_#t~mem261#1.offset, print_formatted_#t~mem262#1, print_formatted_#t~mem263#1.base, print_formatted_#t~mem263#1.offset, print_formatted_#t~mem264#1.base, print_formatted_#t~mem264#1.offset, print_formatted_#t~mem265#1, print_formatted_#t~bitwise266#1, print_formatted_#t~mem267#1.base, print_formatted_#t~mem267#1.offset, print_formatted_#t~mem268#1, print_formatted_#t~mem269#1.base, print_formatted_#t~mem269#1.offset, print_formatted_#t~mem270#1, print_formatted_#t~mem271#1.base, print_formatted_#t~mem271#1.offset, print_formatted_#t~mem272#1.base, print_formatted_#t~mem272#1.offset, print_formatted_#t~mem273#1.base, print_formatted_#t~mem273#1.offset, print_formatted_#t~mem274#1, print_formatted_#t~nondet275#1.base, print_formatted_#t~nondet275#1.offset, print_formatted_#t~mem276#1.base, print_formatted_#t~mem276#1.offset, print_formatted_#t~mem277#1, print_formatted_#t~short278#1, print_formatted_#t~varargs279#1.base, print_formatted_#t~varargs279#1.offset, print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset, print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset, print_formatted_#t~mem282#1, print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset, print_formatted_#t~mem283#1.base, print_formatted_#t~mem283#1.offset, print_formatted_#t~mem284#1.base, print_formatted_#t~mem284#1.offset, print_formatted_#t~mem285#1, print_formatted_#t~mem286#1, print_formatted_#t~bitwise287#1, print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset, print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset, print_formatted_#t~mem290#1, print_formatted_#t~ret291#1, print_formatted_#t~ret292#1, print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset, print_formatted_#t~mem294#1.base, print_formatted_#t~mem294#1.offset, print_formatted_#t~mem295#1, print_formatted_#t~nondet296#1, print_formatted_#t~mem297#1.base, print_formatted_#t~mem297#1.offset, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, print_formatted_~argv#1.base, print_formatted_~argv#1.offset, print_formatted_~conv_err#1.base, print_formatted_~conv_err#1.offset, print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset, print_formatted_~direc_length~0#1, print_formatted_~field_width~0#1, print_formatted_~precision~0#1, print_formatted_~saved_argv~0#1.base, print_formatted_~saved_argv~0#1.offset, print_formatted_~tmp_post$1~0#1.base, print_formatted_~tmp_post$1~0#1.offset, print_formatted_~return_value___builtin_strchr$2~0#1.base, print_formatted_~return_value___builtin_strchr$2~0#1.offset, print_formatted_~tmp_post$3~0#1.base, print_formatted_~tmp_post$3~0#1.offset, print_formatted_~tmp_post$4~0#1.base, print_formatted_~tmp_post$4~0#1.offset, print_formatted_~tmp_post$7~1#1.base, print_formatted_~tmp_post$7~1#1.offset, print_formatted_~return_value_bb_process_escape_sequence$8~0#1;havoc print_formatted_#in~f#1.base, print_formatted_#in~f#1.offset, print_formatted_#in~argv#1.base, print_formatted_#in~argv#1.offset, print_formatted_#in~conv_err#1.base, print_formatted_#in~conv_err#1.offset;assume { :end_inline_print_formatted } true;__main_~argv2~0#1.base, __main_~argv2~0#1.offset := __main_#t~ret310#1.base, __main_#t~ret310#1.offset;havoc __main_#t~ret310#1.base, __main_#t~ret310#1.offset; [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3226: __main_~tmp_if_expr$2~1#1 := (if 0 == (if 0 != (if __main_#t~mem311#1.base != 0 || __main_#t~mem311#1.offset != 0 then 1 else 0) then 1 else 0) then 0 else 1);havoc __main_#t~mem311#1.base, __main_#t~mem311#1.offset; [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3226-1: SUMMARY for call __main_#t~mem311#1.base, __main_#t~mem311#1.offset := read~$Pointer$(__main_~argv2~0#1.base, __main_~argv2~0#1.offset, 8); srcloc: null [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3226-1: assume !(1 == #valid[__main_~argv2~0#1.base]); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3226-1: assume !(8 + __main_~argv2~0#1.offset <= #length[__main_~argv2~0#1.base] && 0 <= __main_~argv2~0#1.offset); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169-1: SUMMARY for call write~$Pointer$(print_formatted_#t~mem288#1.base, 1 + print_formatted_#t~mem288#1.offset, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8); srcloc: null [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169-1: assume !(1 == #valid[print_formatted_~#f#1.base]); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169-1: assume !(8 + print_formatted_~#f#1.offset <= #length[print_formatted_~#f#1.base] && 0 <= print_formatted_~#f#1.offset); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169: havoc print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset; [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169-2: SUMMARY for call print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8); srcloc: null [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169-2: assume !(1 == #valid[print_formatted_~#f#1.base]); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169-2: assume !(8 + print_formatted_~#f#1.offset <= #length[print_formatted_~#f#1.base] && 0 <= print_formatted_~#f#1.offset); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume 99 == print_formatted_#t~mem290#1;havoc print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset;havoc print_formatted_#t~mem290#1;print_formatted_#res#1.base, print_formatted_#res#1.offset := print_formatted_~saved_argv~0#1.base, print_formatted_~saved_argv~0#1.offset;call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume !(99 == print_formatted_#t~mem290#1);havoc print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset;havoc print_formatted_#t~mem290#1; [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170-2: SUMMARY for call print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8); srcloc: null [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170-2: assume !(1 == #valid[print_formatted_~#f#1.base]); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170-2: assume !(8 + print_formatted_~#f#1.offset <= #length[print_formatted_~#f#1.base] && 0 <= print_formatted_~#f#1.offset); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170-1: SUMMARY for call print_formatted_#t~mem290#1 := read~int(print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset, 1); srcloc: null [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170-1: assume !(1 == #valid[print_formatted_#t~mem289#1.base]); [2025-02-08 07:42:43,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170-1: assume !(1 + print_formatted_#t~mem289#1.offset <= #length[print_formatted_#t~mem289#1.base] && 0 <= print_formatted_#t~mem289#1.offset); [2025-02-08 07:42:43,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume #Ultimate.C_memcpy_#t~loopctr381#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616;call #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset := read~unchecked~$Pointer$(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr381#1, 8);call write~unchecked~$Pointer$(#Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr381#1, 8);#Ultimate.C_memcpy_#t~loopctr381#1 := 8 + #Ultimate.C_memcpy_#t~loopctr381#1; [2025-02-08 07:42:43,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume !(#Ultimate.C_memcpy_#t~loopctr381#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616);assume #Ultimate.C_memcpy_#res#1.base == #Ultimate.C_memcpy_dest#1.base && #Ultimate.C_memcpy_#res#1.offset == #Ultimate.C_memcpy_dest#1.offset;print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset := #Ultimate.C_memcpy_#res#1.base, #Ultimate.C_memcpy_#res#1.offset;havoc #Ultimate.C_memcpy_#t~loopctr374#1, #Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_#t~loopctr381#1, #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset;havoc #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset, #Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset, #Ultimate.C_memcpy_size#1;assume { :end_inline_#Ultimate.C_memcpy } true;havoc print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset; [2025-02-08 07:42:43,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume #Ultimate.C_memcpy_#t~loopctr374#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616;call #Ultimate.C_memcpy_#t~mem375#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem376#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem377#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 1);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 1);call #Ultimate.C_memcpy_#t~mem378#1 := read~unchecked~real(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~real(#Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem379#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 4);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 4);call #Ultimate.C_memcpy_#t~mem380#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 2);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 2);#Ultimate.C_memcpy_#t~loopctr374#1 := 1 + #Ultimate.C_memcpy_#t~loopctr374#1; [2025-02-08 07:42:43,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume !(#Ultimate.C_memcpy_#t~loopctr374#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616);#Ultimate.C_memcpy_#t~loopctr381#1 := 0; [2025-02-08 07:42:43,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-2: assume #Ultimate.C_memcpy_size#1 + #Ultimate.C_memcpy_src#1.offset <= #length[#Ultimate.C_memcpy_src#1.base] && 0 <= #Ultimate.C_memcpy_src#1.offset;assume 1 == #valid[#Ultimate.C_memcpy_dest#1.base];assume 1 == #valid[#Ultimate.C_memcpy_src#1.base];assume #Ultimate.C_memcpy_size#1 + #Ultimate.C_memcpy_dest#1.offset <= #length[#Ultimate.C_memcpy_dest#1.base] && 0 <= #Ultimate.C_memcpy_dest#1.offset;assume #Ultimate.C_memcpy_size#1 + #Ultimate.C_memcpy_src#1.offset <= #length[#Ultimate.C_memcpy_src#1.base] && 0 <= #Ultimate.C_memcpy_src#1.offset;havoc #Ultimate.C_memcpy_#res#1.base, #Ultimate.C_memcpy_#res#1.offset;havoc #Ultimate.C_memcpy_#t~loopctr374#1, #Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_#t~loopctr381#1, #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset;#Ultimate.C_memcpy_#t~loopctr374#1 := 0; [2025-02-08 07:42:43,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-2: assume !(#Ultimate.C_memcpy_size#1 + #Ultimate.C_memcpy_src#1.offset <= #length[#Ultimate.C_memcpy_src#1.base] && 0 <= #Ultimate.C_memcpy_src#1.offset); [2025-02-08 07:42:43,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-3: assume #Ultimate.C_memcpy_size#1 + #Ultimate.C_memcpy_dest#1.offset <= #length[#Ultimate.C_memcpy_dest#1.base] && 0 <= #Ultimate.C_memcpy_dest#1.offset; [2025-02-08 07:42:43,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-3: assume !(#Ultimate.C_memcpy_size#1 + #Ultimate.C_memcpy_dest#1.offset <= #length[#Ultimate.C_memcpy_dest#1.base] && 0 <= #Ultimate.C_memcpy_dest#1.offset); [2025-02-08 07:42:43,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-4: assume 1 == #valid[#Ultimate.C_memcpy_src#1.base]; [2025-02-08 07:42:43,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-4: assume !(1 == #valid[#Ultimate.C_memcpy_src#1.base]); [2025-02-08 07:42:43,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-5: assume 1 == #valid[#Ultimate.C_memcpy_dest#1.base]; [2025-02-08 07:42:43,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-5: assume !(1 == #valid[#Ultimate.C_memcpy_dest#1.base]); [2025-02-08 07:42:43,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172: assume -128 <= print_formatted_#t~ret291#1 && print_formatted_#t~ret291#1 <= 127;print_formatted_~return_value_bb_process_escape_sequence$8~0#1 := print_formatted_#t~ret291#1;havoc print_formatted_#t~ret291#1; [2025-02-08 07:42:43,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172-1: SUMMARY for call print_formatted_#t~ret291#1 := bb_process_escape_sequence(print_formatted_~#f#1.base, print_formatted_~#f#1.offset); srcloc: null [2025-02-08 07:42:43,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173-1: SUMMARY for call print_formatted_#t~ret292#1 := bb_putchar(print_formatted_~return_value_bb_process_escape_sequence$8~0#1); srcloc: null [2025-02-08 07:42:43,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: assume -2147483648 <= print_formatted_#t~ret292#1 && print_formatted_#t~ret292#1 <= 2147483647;havoc print_formatted_#t~ret292#1; [2025-02-08 07:42:43,688 INFO L? ?]: Removed 1180 outVars from TransFormulas that were not future-live. [2025-02-08 07:42:43,688 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:42:43,722 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:42:43,723 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:42:43,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:42:43 BoogieIcfgContainer [2025-02-08 07:42:43,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:42:43,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:42:43,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:42:43,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:42:43,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:42:35" (1/3) ... [2025-02-08 07:42:43,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ca1b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:42:43, skipping insertion in model container [2025-02-08 07:42:43,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:37" (2/3) ... [2025-02-08 07:42:43,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ca1b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:42:43, skipping insertion in model container [2025-02-08 07:42:43,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:42:43" (3/3) ... [2025-02-08 07:42:43,733 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-02-08 07:42:43,746 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:42:43,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 1090 locations, 1 initial locations, 23 loop locations, and 494 error locations. [2025-02-08 07:42:43,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:42:43,810 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=None, 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;@6419c234, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:42:43,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 494 error locations. [2025-02-08 07:42:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 1058 states, 551 states have (on average 2.0544464609800364) internal successors, (1132), 1013 states have internal predecessors, (1132), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-08 07:42:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:42:43,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:43,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:42:43,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr249REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-02-08 07:42:43,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash 47711, now seen corresponding path program 1 times [2025-02-08 07:42:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:43,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112119104] [2025-02-08 07:42:43,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:44,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:42:44,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:42:44,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:44,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:44,991 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 07:42:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112119104] [2025-02-08 07:42:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112119104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:42:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502740866] [2025-02-08 07:42:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:45,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:45,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:45,015 INFO L87 Difference]: Start difference. First operand has 1058 states, 551 states have (on average 2.0544464609800364) internal successors, (1132), 1013 states have internal predecessors, (1132), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 07:42:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:45,855 INFO L93 Difference]: Finished difference Result 949 states and 1066 transitions. [2025-02-08 07:42:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:42:45,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:42:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:45,866 INFO L225 Difference]: With dead ends: 949 [2025-02-08 07:42:45,866 INFO L226 Difference]: Without dead ends: 921 [2025-02-08 07:42:45,871 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 07:42:45,873 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 395 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:45,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1081 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 07:42:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-02-08 07:42:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 770. [2025-02-08 07:42:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 405 states have (on average 2.0123456790123457) internal successors, (815), 743 states have internal predecessors, (815), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 07:42:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 858 transitions. [2025-02-08 07:42:46,011 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 858 transitions. Word has length 2 [2025-02-08 07:42:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:46,015 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 858 transitions. [2025-02-08 07:42:46,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 07:42:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 858 transitions. [2025-02-08 07:42:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:42:46,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:46,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:42:46,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:42:46,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr250REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-02-08 07:42:46,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:46,017 INFO L85 PathProgramCache]: Analyzing trace with hash 47712, now seen corresponding path program 1 times [2025-02-08 07:42:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:46,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550326385] [2025-02-08 07:42:46,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:46,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:42:46,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:42:46,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:47,117 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 07:42:47,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:47,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550326385] [2025-02-08 07:42:47,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550326385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:47,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:47,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:42:47,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269024707] [2025-02-08 07:42:47,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:47,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:47,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:47,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:47,119 INFO L87 Difference]: Start difference. First operand 770 states and 858 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 07:42:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:47,655 INFO L93 Difference]: Finished difference Result 769 states and 857 transitions. [2025-02-08 07:42:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:42:47,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:42:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:47,657 INFO L225 Difference]: With dead ends: 769 [2025-02-08 07:42:47,657 INFO L226 Difference]: Without dead ends: 769 [2025-02-08 07:42:47,658 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 07:42:47,658 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 10 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:47,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1364 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:42:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-02-08 07:42:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2025-02-08 07:42:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 405 states have (on average 2.0098765432098764) internal successors, (814), 742 states have internal predecessors, (814), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 07:42:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 857 transitions. [2025-02-08 07:42:47,670 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 857 transitions. Word has length 2 [2025-02-08 07:42:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:47,670 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 857 transitions. [2025-02-08 07:42:47,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 07:42:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 857 transitions. [2025-02-08 07:42:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:42:47,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:47,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:42:47,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:42:47,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr248REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-02-08 07:42:47,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1422775378, now seen corresponding path program 1 times [2025-02-08 07:42:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:47,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061933523] [2025-02-08 07:42:47,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:47,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:48,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:42:48,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:42:48,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:48,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:48,422 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 07:42:48,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:48,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061933523] [2025-02-08 07:42:48,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061933523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:48,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:48,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:42:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362789371] [2025-02-08 07:42:48,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:48,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:42:48,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:48,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:42:48,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:48,424 INFO L87 Difference]: Start difference. First operand 769 states and 857 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:52,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:53,212 INFO L93 Difference]: Finished difference Result 772 states and 860 transitions. [2025-02-08 07:42:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:42:53,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:42:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:53,215 INFO L225 Difference]: With dead ends: 772 [2025-02-08 07:42:53,215 INFO L226 Difference]: Without dead ends: 772 [2025-02-08 07:42:53,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:53,216 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 11 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:53,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1364 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-02-08 07:42:53,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-02-08 07:42:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 771. [2025-02-08 07:42:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 407 states have (on average 2.004914004914005) internal successors, (816), 744 states have internal predecessors, (816), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 07:42:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 859 transitions. [2025-02-08 07:42:53,233 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 859 transitions. Word has length 5 [2025-02-08 07:42:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:53,233 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 859 transitions. [2025-02-08 07:42:53,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 859 transitions. [2025-02-08 07:42:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:42:53,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:53,234 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:53,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:42:53,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr248REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-02-08 07:42:53,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1129575845, now seen corresponding path program 1 times [2025-02-08 07:42:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:53,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554022598] [2025-02-08 07:42:53,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:53,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:42:53,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:42:53,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:53,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:54,209 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 07:42:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554022598] [2025-02-08 07:42:54,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554022598] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11887487] [2025-02-08 07:42:54,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:54,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:54,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:54,214 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 07:42:54,216 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 07:42:54,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:42:54,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:42:54,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:54,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:54,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:42:54,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:55,093 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 07:42:55,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:55,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 07:42:55,221 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 07:42:55,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11887487] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:55,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:42:55,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:42:55,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644900135] [2025-02-08 07:42:55,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:55,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:42:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:55,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:42:55,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:42:55,222 INFO L87 Difference]: Start difference. First operand 771 states and 859 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 07:42:59,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:03,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:07,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:11,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:15,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:19,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:23,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:25,510 INFO L93 Difference]: Finished difference Result 775 states and 863 transitions. [2025-02-08 07:43:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:43:25,511 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:43:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:25,513 INFO L225 Difference]: With dead ends: 775 [2025-02-08 07:43:25,513 INFO L226 Difference]: Without dead ends: 775 [2025-02-08 07:43:25,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:43:25,515 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 457 mSDsluCounter, 2572 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 7 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:25,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 3414 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1271 Invalid, 7 Unknown, 0 Unchecked, 30.2s Time] [2025-02-08 07:43:25,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-08 07:43:25,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2025-02-08 07:43:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 412 states have (on average 1.9902912621359223) internal successors, (820), 748 states have internal predecessors, (820), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 07:43:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 863 transitions. [2025-02-08 07:43:25,529 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 863 transitions. Word has length 8 [2025-02-08 07:43:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:25,529 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 863 transitions. [2025-02-08 07:43:25,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 07:43:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 863 transitions. [2025-02-08 07:43:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 07:43:25,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:25,530 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2025-02-08 07:43:25,544 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 07:43:25,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:25,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr245REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-02-08 07:43:25,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:25,734 INFO L85 PathProgramCache]: Analyzing trace with hash -292293030, now seen corresponding path program 1 times [2025-02-08 07:43:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:25,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934082926] [2025-02-08 07:43:25,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:25,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:26,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 07:43:26,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 07:43:26,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:26,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:26,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:26,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934082926] [2025-02-08 07:43:26,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934082926] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:26,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457702056] [2025-02-08 07:43:26,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:26,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:26,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:26,403 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 07:43:26,404 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 07:43:27,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 07:43:27,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 07:43:27,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:27,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:27,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 1728 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 07:43:27,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:27,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457702056] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:27,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-08 07:43:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905323310] [2025-02-08 07:43:27,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:27,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:43:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:27,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:43:27,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:43:27,365 INFO L87 Difference]: Start difference. First operand 775 states and 863 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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 07:43:31,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:35,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:39,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:43,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:47,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:51,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:55,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:43:59,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:44:03,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:44:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:03,788 INFO L93 Difference]: Finished difference Result 790 states and 878 transitions. [2025-02-08 07:44:03,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:44:03,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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 14 [2025-02-08 07:44:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:03,790 INFO L225 Difference]: With dead ends: 790 [2025-02-08 07:44:03,790 INFO L226 Difference]: Without dead ends: 790 [2025-02-08 07:44:03,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:44:03,791 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 4 mSDsluCounter, 3384 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4233 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:03,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4233 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 9 Unknown, 0 Unchecked, 36.4s Time] [2025-02-08 07:44:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-02-08 07:44:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-02-08 07:44:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 427 states have (on average 1.955503512880562) internal successors, (835), 763 states have internal predecessors, (835), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 07:44:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 878 transitions. [2025-02-08 07:44:03,801 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 878 transitions. Word has length 14 [2025-02-08 07:44:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:03,801 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 878 transitions. [2025-02-08 07:44:03,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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 07:44:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 878 transitions. [2025-02-08 07:44:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 07:44:03,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:03,802 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2025-02-08 07:44:03,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:44:04,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:04,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr245REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-02-08 07:44:04,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1341980977, now seen corresponding path program 2 times [2025-02-08 07:44:04,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:04,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782288173] [2025-02-08 07:44:04,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:44:04,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:04,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-08 07:44:04,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 29 statements. [2025-02-08 07:44:04,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:44:04,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 07:44:05,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:05,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782288173] [2025-02-08 07:44:05,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782288173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:44:05,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:44:05,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:44:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491291212] [2025-02-08 07:44:05,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:44:05,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:44:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:05,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:44:05,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:44:05,034 INFO L87 Difference]: Start difference. First operand 790 states and 878 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:44:06,298 INFO L93 Difference]: Finished difference Result 1269 states and 1430 transitions. [2025-02-08 07:44:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:44:06,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-08 07:44:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:44:06,302 INFO L225 Difference]: With dead ends: 1269 [2025-02-08 07:44:06,303 INFO L226 Difference]: Without dead ends: 1269 [2025-02-08 07:44:06,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:44:06,303 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 1551 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:44:06,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 1272 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:44:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-02-08 07:44:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 789. [2025-02-08 07:44:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 427 states have (on average 1.9531615925058547) internal successors, (834), 762 states have internal predecessors, (834), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 07:44:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 877 transitions. [2025-02-08 07:44:06,344 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 877 transitions. Word has length 29 [2025-02-08 07:44:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:44:06,344 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 877 transitions. [2025-02-08 07:44:06,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:44:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 877 transitions. [2025-02-08 07:44:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 07:44:06,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:44:06,345 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2025-02-08 07:44:06,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:44:06,345 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr246REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-02-08 07:44:06,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:44:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1341980978, now seen corresponding path program 1 times [2025-02-08 07:44:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:44:06,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416701986] [2025-02-08 07:44:06,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:44:06,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 07:44:06,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 07:44:06,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:06,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:07,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:44:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416701986] [2025-02-08 07:44:07,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416701986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:44:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398714865] [2025-02-08 07:44:07,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:44:07,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:44:07,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:44:07,163 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 07:44:07,167 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 07:44:07,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 07:44:08,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 07:44:08,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:44:08,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:08,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 1853 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 07:44:08,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:08,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:44:08,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398714865] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:44:08,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:44:08,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-02-08 07:44:08,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267621818] [2025-02-08 07:44:08,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:44:08,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:44:08,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:44:08,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:44:08,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:44:08,262 INFO L87 Difference]: Start difference. First operand 789 states and 877 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 07:44:12,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []