./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/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-?-c00e63d-m [2025-02-06 12:04:20,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:04:20,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:04:20,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:04:20,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:04:20,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:04:20,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:04:20,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:04:20,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:04:20,765 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:04:20,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:04:20,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:04:20,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:04:20,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:04:20,766 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:04:20,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:04:20,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:04:20,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:04:20,766 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:04:20,766 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:04:20,766 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:04:20,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:04:20,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:04:20,767 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:04:20,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:04:20,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:04:20,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:04:20,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:04:20,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:04:20,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:04:20,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:04:20,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:04:20,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:04:20,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:04:20,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:04:20,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:04:20,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:04:20,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:04:20,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:04:20,769 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-06 12:04:21,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:04:21,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:04:21,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:04:21,047 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:04:21,047 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:04:21,048 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-06 12:04:22,290 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/602d8bc0f/7155a82a9c7645c086cc8680ff2ce116/FLAGb5f507cd8 [2025-02-06 12:04:22,685 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:04:22,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-02-06 12:04:22,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/602d8bc0f/7155a82a9c7645c086cc8680ff2ce116/FLAGb5f507cd8 [2025-02-06 12:04:22,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/602d8bc0f/7155a82a9c7645c086cc8680ff2ce116 [2025-02-06 12:04:22,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:04:22,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:04:22,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:04:22,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:04:22,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:04:22,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:22" (1/1) ... [2025-02-06 12:04:22,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474ef4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:22, skipping insertion in model container [2025-02-06 12:04:22,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:22" (1/1) ... [2025-02-06 12:04:22,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:04:23,582 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,583 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,593 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,599 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,606 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,607 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,608 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,609 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,610 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,610 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,610 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,611 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,611 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,613 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,614 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,615 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,616 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,618 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,618 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,618 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,619 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,619 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,619 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,621 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,621 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,622 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,625 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,628 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,629 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,630 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,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-06 12:04:23,633 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,635 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,636 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,637 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,639 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,640 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,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-06 12:04:23,644 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,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-06 12:04:23,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-06 12:04:23,653 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,654 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,654 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,654 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,659 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,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-06 12:04:23,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-06 12:04:23,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-06 12:04:23,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-06 12:04:23,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-06 12:04:23,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-06 12:04:23,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-06 12:04:23,671 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,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-06 12:04:23,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-06 12:04:23,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-06 12:04:23,680 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,681 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,690 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:23,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-06 12:04:23,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:04:23,747 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:04:23,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:04:24,031 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 12:04:24,044 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:04:24,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24 WrapperNode [2025-02-06 12:04:24,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:04:24,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:04:24,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:04:24,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:04:24,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,225 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1858 [2025-02-06 12:04:24,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:04:24,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:04:24,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:04:24,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:04:24,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,263 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 12:04:24,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:04:24,391 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:04:24,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:04:24,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:04:24,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (1/1) ... [2025-02-06 12:04:24,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:04:24,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:24,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:04:24,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:04:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 12:04:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-02-06 12:04:24,445 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-02-06 12:04:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:04:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 12:04:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-02-06 12:04:24,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-02-06 12:04:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 12:04:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 12:04:24,447 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 12:04:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 12:04:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 12:04:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-02-06 12:04:24,447 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-02-06 12:04:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 12:04:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:04:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 12:04:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 12:04:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-02-06 12:04:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-02-06 12:04:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:04:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:04:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-02-06 12:04:24,448 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-02-06 12:04:24,449 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-02-06 12:04:24,449 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-02-06 12:04:24,449 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 12:04:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-02-06 12:04:24,449 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-02-06 12:04:24,841 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:04:24,846 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:04:24,990 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-02-06 12:04:25,347 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset; [2025-02-06 12:04:25,411 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-02-06 12:04:25,694 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-02-06 12:04:25,694 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-02-06 12:04:25,695 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-02-06 12:04:25,695 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-02-06 12:04:31,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-02-06 12:04:31,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-02-06 12:04:31,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-02-06 12:04:31,516 INFO L? ?]: Removed 1346 outVars from TransFormulas that were not future-live. [2025-02-06 12:04:31,517 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:04:31,563 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:04:31,563 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:04:31,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:31 BoogieIcfgContainer [2025-02-06 12:04:31,564 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:04:31,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:04:31,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:04:31,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:04:31,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:04:22" (1/3) ... [2025-02-06 12:04:31,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89a60e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:31, skipping insertion in model container [2025-02-06 12:04:31,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:24" (2/3) ... [2025-02-06 12:04:31,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89a60e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:31, skipping insertion in model container [2025-02-06 12:04:31,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:31" (3/3) ... [2025-02-06 12:04:31,577 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-02-06 12:04:31,589 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:04:31,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 1227 locations, 1 initial locations, 23 loop locations, and 494 error locations. [2025-02-06 12:04:31,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:04:31,658 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;@4fc7b9b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:04:31,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 494 error locations. [2025-02-06 12:04:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 1227 states, 666 states have (on average 2.0045045045045047) internal successors, (1335), 1175 states have internal predecessors, (1335), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 12:04:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:31,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:31,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:31,677 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-06 12:04:31,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1499397, now seen corresponding path program 1 times [2025-02-06 12:04:31,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:31,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143149784] [2025-02-06 12:04:31,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:31,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:32,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:32,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:32,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:32,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:33,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:33,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143149784] [2025-02-06 12:04:33,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143149784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:33,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:33,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:33,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784366511] [2025-02-06 12:04:33,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:33,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:33,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:33,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:33,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:33,230 INFO L87 Difference]: Start difference. First operand has 1227 states, 666 states have (on average 2.0045045045045047) internal successors, (1335), 1175 states have internal predecessors, (1335), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:37,290 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-06 12:04:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:39,596 INFO L93 Difference]: Finished difference Result 1382 states and 1577 transitions. [2025-02-06 12:04:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:04:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:39,614 INFO L225 Difference]: With dead ends: 1382 [2025-02-06 12:04:39,614 INFO L226 Difference]: Without dead ends: 1380 [2025-02-06 12:04:39,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:39,617 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 447 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:39,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1640 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 664 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2025-02-06 12:04:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-02-06 12:04:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1045. [2025-02-06 12:04:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 567 states have (on average 1.9700176366843034) internal successors, (1117), 998 states have internal predecessors, (1117), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 12:04:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1199 transitions. [2025-02-06 12:04:39,691 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1199 transitions. Word has length 3 [2025-02-06 12:04:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:39,692 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1199 transitions. [2025-02-06 12:04:39,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1199 transitions. [2025-02-06 12:04:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:39,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:39,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:39,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:04:39,693 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-06 12:04:39,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:39,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1499398, now seen corresponding path program 1 times [2025-02-06 12:04:39,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:39,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085170268] [2025-02-06 12:04:39,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:40,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:40,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:40,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:40,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:40,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:40,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085170268] [2025-02-06 12:04:40,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085170268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:40,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:40,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:40,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331727549] [2025-02-06 12:04:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:40,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:40,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:40,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:40,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:40,823 INFO L87 Difference]: Start difference. First operand 1045 states and 1199 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:44,866 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-06 12:04:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:46,746 INFO L93 Difference]: Finished difference Result 1044 states and 1198 transitions. [2025-02-06 12:04:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:46,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:04:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:46,751 INFO L225 Difference]: With dead ends: 1044 [2025-02-06 12:04:46,751 INFO L226 Difference]: Without dead ends: 1044 [2025-02-06 12:04:46,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:46,752 INFO L435 NwaCegarLoop]: 1187 mSDtfsCounter, 10 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:46,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1948 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-02-06 12:04:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-02-06 12:04:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1044. [2025-02-06 12:04:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 567 states have (on average 1.9682539682539681) internal successors, (1116), 997 states have internal predecessors, (1116), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 12:04:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1198 transitions. [2025-02-06 12:04:46,805 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1198 transitions. Word has length 3 [2025-02-06 12:04:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:46,805 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1198 transitions. [2025-02-06 12:04:46,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1198 transitions. [2025-02-06 12:04:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:04:46,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:46,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:04:46,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:04:46,807 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-06 12:04:46,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1720297918, now seen corresponding path program 1 times [2025-02-06 12:04:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858278673] [2025-02-06 12:04:46,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:47,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:04:47,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:04:47,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:47,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:48,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858278673] [2025-02-06 12:04:48,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858278673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:48,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:48,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815252181] [2025-02-06 12:04:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:48,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:04:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:48,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:04:48,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:04:48,006 INFO L87 Difference]: Start difference. First operand 1044 states and 1198 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:52,030 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-06 12:04:56,090 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-06 12:04:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:57,864 INFO L93 Difference]: Finished difference Result 1047 states and 1201 transitions. [2025-02-06 12:04:57,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:04:57,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 12:04:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:57,869 INFO L225 Difference]: With dead ends: 1047 [2025-02-06 12:04:57,869 INFO L226 Difference]: Without dead ends: 1047 [2025-02-06 12:04:57,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-06 12:04:57,871 INFO L435 NwaCegarLoop]: 1185 mSDtfsCounter, 11 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:57,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1948 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 446 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2025-02-06 12:04:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-02-06 12:04:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1046. [2025-02-06 12:04:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 569 states have (on average 1.9648506151142355) internal successors, (1118), 999 states have internal predecessors, (1118), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 12:04:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1200 transitions. [2025-02-06 12:04:57,908 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1200 transitions. Word has length 6 [2025-02-06 12:04:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:57,908 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1200 transitions. [2025-02-06 12:04:57,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1200 transitions. [2025-02-06 12:04:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:04:57,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:57,909 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:57,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:04:57,909 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-06 12:04:57,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1846899521, now seen corresponding path program 1 times [2025-02-06 12:04:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:57,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981009967] [2025-02-06 12:04:57,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:57,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:58,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:58,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:58,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:58,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:59,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981009967] [2025-02-06 12:04:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981009967] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020080094] [2025-02-06 12:04:59,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:59,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:59,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:59,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:59,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:05:00,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:05:00,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:05:00,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:00,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:00,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:05:00,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:05:00,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:00,794 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-06 12:05:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:05:00,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020080094] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:00,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:00,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:05:00,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988343568] [2025-02-06 12:05:00,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:00,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:05:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:00,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:05:00,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:05:00,848 INFO L87 Difference]: Start difference. First operand 1046 states and 1200 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:04,875 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-06 12:05:08,885 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-06 12:05:12,944 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-06 12:05:16,982 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-06 12:05:21,023 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-06 12:05:25,035 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-06 12:05:29,096 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-06 12:05:33,129 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-06 12:05:37,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 12:05:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:43,176 INFO L93 Difference]: Finished difference Result 1050 states and 1204 transitions. [2025-02-06 12:05:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:05:43,177 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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 9 [2025-02-06 12:05:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:43,180 INFO L225 Difference]: With dead ends: 1050 [2025-02-06 12:05:43,180 INFO L226 Difference]: Without dead ends: 1050 [2025-02-06 12:05:43,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:05:43,181 INFO L435 NwaCegarLoop]: 1183 mSDtfsCounter, 536 mSDsluCounter, 5047 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 6 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 6230 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:43,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 6230 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2246 Invalid, 9 Unknown, 0 Unchecked, 42.1s Time] [2025-02-06 12:05:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-02-06 12:05:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050. [2025-02-06 12:05:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 574 states have (on average 1.9547038327526132) internal successors, (1122), 1003 states have internal predecessors, (1122), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 12:05:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1204 transitions. [2025-02-06 12:05:43,205 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1204 transitions. Word has length 9 [2025-02-06 12:05:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:43,205 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1204 transitions. [2025-02-06 12:05:43,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1204 transitions. [2025-02-06 12:05:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 12:05:43,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:43,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:43,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:05:43,411 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-06 12:05:43,411 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-06 12:05:43,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1541796224, now seen corresponding path program 1 times [2025-02-06 12:05:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829667059] [2025-02-06 12:05:43,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:43,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:05:43,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:05:43,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:43,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:44,293 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-06 12:05:44,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:44,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829667059] [2025-02-06 12:05:44,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829667059] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:44,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443508783] [2025-02-06 12:05:44,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:44,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:44,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:44,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:44,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:05:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:05:45,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:05:45,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:45,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 1728 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:05:45,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:45,288 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-06 12:05:45,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:45,515 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-06 12:05:45,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443508783] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:45,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:45,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 12:05:45,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592400926] [2025-02-06 12:05:45,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:45,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:05:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:45,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:05:45,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:05:45,516 INFO L87 Difference]: Start difference. First operand 1050 states and 1204 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:45,673 INFO L93 Difference]: Finished difference Result 1065 states and 1219 transitions. [2025-02-06 12:05:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:05:45,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 15 [2025-02-06 12:05:45,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:45,680 INFO L225 Difference]: With dead ends: 1065 [2025-02-06 12:05:45,680 INFO L226 Difference]: Without dead ends: 1065 [2025-02-06 12:05:45,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:05:45,681 INFO L435 NwaCegarLoop]: 1190 mSDtfsCounter, 4 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:45,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2377 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:05:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-02-06 12:05:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2025-02-06 12:05:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 589 states have (on average 1.930390492359932) internal successors, (1137), 1018 states have internal predecessors, (1137), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 12:05:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1219 transitions. [2025-02-06 12:05:45,708 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1219 transitions. Word has length 15 [2025-02-06 12:05:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:45,709 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1219 transitions. [2025-02-06 12:05:45,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1219 transitions. [2025-02-06 12:05:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:05:45,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:45,710 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:45,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:05:45,915 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-06 12:05:45,915 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-06 12:05:45,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1320727139, now seen corresponding path program 2 times [2025-02-06 12:05:45,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:45,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749628339] [2025-02-06 12:05:45,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:05:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:46,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 12:05:46,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-02-06 12:05:46,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:05:46,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:47,082 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-06 12:05:47,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:47,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749628339] [2025-02-06 12:05:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749628339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:05:47,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:05:47,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:05:47,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833727335] [2025-02-06 12:05:47,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:05:47,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:05:47,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:47,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:05:47,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:47,084 INFO L87 Difference]: Start difference. First operand 1065 states and 1219 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:49,705 INFO L93 Difference]: Finished difference Result 1860 states and 2148 transitions. [2025-02-06 12:05:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:05:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 30 [2025-02-06 12:05:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:49,715 INFO L225 Difference]: With dead ends: 1860 [2025-02-06 12:05:49,715 INFO L226 Difference]: Without dead ends: 1860 [2025-02-06 12:05:49,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:05:49,718 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 1923 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:49,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 2137 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 12:05:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-02-06 12:05:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1064. [2025-02-06 12:05:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 589 states have (on average 1.9286926994906621) internal successors, (1136), 1017 states have internal predecessors, (1136), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 12:05:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1218 transitions. [2025-02-06 12:05:49,752 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1218 transitions. Word has length 30 [2025-02-06 12:05:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:49,752 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1218 transitions. [2025-02-06 12:05:49,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:05:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1218 transitions. [2025-02-06 12:05:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:05:49,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:49,753 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:49,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:05:49,754 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-06 12:05:49,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1320727138, now seen corresponding path program 1 times [2025-02-06 12:05:49,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:49,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988142049] [2025-02-06 12:05:49,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:50,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:05:50,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:05:50,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:50,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:50,974 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-06 12:05:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988142049] [2025-02-06 12:05:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988142049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132861466] [2025-02-06 12:05:50,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:50,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:50,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:50,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:50,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:05:51,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:05:51,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:05:51,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:51,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:51,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 1853 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:05:51,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:52,063 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-06 12:05:52,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:52,457 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-06 12:05:52,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132861466] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:52,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:52,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-02-06 12:05:52,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124999473] [2025-02-06 12:05:52,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:52,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:05:52,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:52,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:05:52,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:05:52,459 INFO L87 Difference]: Start difference. First operand 1064 states and 1218 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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)