./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/printf-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 13:31:33,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:31:33,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 13:31:33,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:31:33,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:31:33,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:31:33,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:31:33,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:31:33,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:31:33,150 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:31:33,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:31:33,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:31:33,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:31:33,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:31:33,151 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:31:33,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:31:33,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:31:33,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:31:33,152 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:31:33,152 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:31:33,152 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:31:33,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:31:33,152 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:31:33,152 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:31:33,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:31:33,153 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:31:33,153 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:31:33,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:31:33,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:31:33,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:31:33,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:31:33,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:31:33,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:31:33,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:31:33,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:31:33,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:31:33,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:31:33,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:31:33,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:31:33,154 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/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-03-17 13:31:33,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:31:33,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:31:33,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:31:33,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:31:33,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:31:33,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-17 13:31:34,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fddd83ad/76cb74a7f21a4854828497ce92adebc4/FLAG20978668b [2025-03-17 13:31:34,815 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:31:34,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-17 13:31:34,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fddd83ad/76cb74a7f21a4854828497ce92adebc4/FLAG20978668b [2025-03-17 13:31:35,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fddd83ad/76cb74a7f21a4854828497ce92adebc4 [2025-03-17 13:31:35,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:31:35,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:31:35,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:31:35,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:31:35,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:31:35,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:31:35" (1/1) ... [2025-03-17 13:31:35,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d636a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:35, skipping insertion in model container [2025-03-17 13:31:35,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:31:35" (1/1) ... [2025-03-17 13:31:35,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:31:35,776 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,780 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,791 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,798 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,800 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,804 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,805 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,806 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,806 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,806 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,807 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,807 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,808 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,809 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,810 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,811 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,811 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,813 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,813 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,813 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,814 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,814 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,814 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,816 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,816 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,816 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,820 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,823 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,823 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,824 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,826 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,827 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,828 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,830 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,832 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,833 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,834 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,835 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,837 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,839 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,839 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,840 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,840 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,840 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,841 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,844 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,845 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,846 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,847 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,849 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,851 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,851 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,851 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,852 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,852 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,853 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,858 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,859 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,860 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,864 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,876 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:35,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:31:35,907 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:31:36,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:31:36,171 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 13:31:36,179 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:31:36,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36 WrapperNode [2025-03-17 13:31:36,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:31:36,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:31:36,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:31:36,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:31:36,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,300 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1858 [2025-03-17 13:31:36,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:31:36,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:31:36,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:31:36,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:31:36,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,333 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 13:31:36,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:31:36,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:31:36,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:31:36,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:31:36,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (1/1) ... [2025-03-17 13:31:36,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:31:36,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:36,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 13:31:36,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 13:31:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 13:31:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-17 13:31:36,468 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-17 13:31:36,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:31:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 13:31:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-17 13:31:36,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-17 13:31:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 13:31:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-17 13:31:36,469 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-17 13:31:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 13:31:36,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 13:31:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-17 13:31:36,470 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-17 13:31:36,828 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:31:36,830 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:31:36,978 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-17 13:31:37,313 INFO L1322 $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-03-17 13:31:37,374 INFO L1322 $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-03-17 13:31:37,657 INFO L1322 $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-03-17 13:31:37,658 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-17 13:31:37,658 INFO L1322 $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-03-17 13:31:37,658 INFO L1322 $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-03-17 13:31:42,997 INFO L1322 $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-03-17 13:31:42,998 INFO L1322 $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-03-17 13:31:42,998 INFO L1322 $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-03-17 13:31:43,132 INFO L? ?]: Removed 1328 outVars from TransFormulas that were not future-live. [2025-03-17 13:31:43,132 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:31:43,174 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:31:43,174 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:31:43,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:31:43 BoogieIcfgContainer [2025-03-17 13:31:43,174 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:31:43,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:31:43,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:31:43,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:31:43,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:31:35" (1/3) ... [2025-03-17 13:31:43,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38074aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:31:43, skipping insertion in model container [2025-03-17 13:31:43,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:36" (2/3) ... [2025-03-17 13:31:43,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38074aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:31:43, skipping insertion in model container [2025-03-17 13:31:43,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:31:43" (3/3) ... [2025-03-17 13:31:43,182 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-03-17 13:31:43,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:31:43,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 1203 locations, 1 initial locations, 23 loop locations, and 494 error locations. [2025-03-17 13:31:43,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:31:43,254 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;@63164734, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:31:43,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 494 error locations. [2025-03-17 13:31:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 1203 states, 642 states have (on average 2.042056074766355) internal successors, (1311), 1151 states have internal predecessors, (1311), 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-03-17 13:31:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:31:43,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:43,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:31:43,266 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-03-17 13:31:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash 47295, now seen corresponding path program 1 times [2025-03-17 13:31:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:43,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644752838] [2025-03-17 13:31:43,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:43,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:43,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:31:44,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:31:44,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:44,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644752838] [2025-03-17 13:31:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644752838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:44,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:44,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:31:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726343536] [2025-03-17 13:31:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:44,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:31:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:44,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:31:44,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:44,522 INFO L87 Difference]: Start difference. First operand has 1203 states, 642 states have (on average 2.042056074766355) internal successors, (1311), 1151 states have internal predecessors, (1311), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:46,289 INFO L93 Difference]: Finished difference Result 1359 states and 1554 transitions. [2025-03-17 13:31:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:31:46,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 13:31:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:46,306 INFO L225 Difference]: With dead ends: 1359 [2025-03-17 13:31:46,306 INFO L226 Difference]: Without dead ends: 1357 [2025-03-17 13:31:46,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:46,310 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 439 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:46,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1605 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 13:31:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-03-17 13:31:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1030. [2025-03-17 13:31:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 552 states have (on average 1.9963768115942029) internal successors, (1102), 983 states have internal predecessors, (1102), 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-03-17 13:31:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1184 transitions. [2025-03-17 13:31:46,402 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1184 transitions. Word has length 2 [2025-03-17 13:31:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:46,402 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1184 transitions. [2025-03-17 13:31:46,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1184 transitions. [2025-03-17 13:31:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:31:46,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:46,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:31:46,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:31:46,403 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-03-17 13:31:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 47296, now seen corresponding path program 1 times [2025-03-17 13:31:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958193401] [2025-03-17 13:31:46,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:46,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:31:46,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:31:46,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:46,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:47,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958193401] [2025-03-17 13:31:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958193401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:47,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:31:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415800319] [2025-03-17 13:31:47,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:47,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:31:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:47,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:31:47,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:47,293 INFO L87 Difference]: Start difference. First operand 1030 states and 1184 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:48,243 INFO L93 Difference]: Finished difference Result 1029 states and 1183 transitions. [2025-03-17 13:31:48,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:31:48,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 13:31:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:48,247 INFO L225 Difference]: With dead ends: 1029 [2025-03-17 13:31:48,247 INFO L226 Difference]: Without dead ends: 1029 [2025-03-17 13:31:48,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:48,247 INFO L435 NwaCegarLoop]: 1172 mSDtfsCounter, 10 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:48,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1919 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 13:31:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-17 13:31:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2025-03-17 13:31:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 552 states have (on average 1.9945652173913044) internal successors, (1101), 982 states have internal predecessors, (1101), 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-03-17 13:31:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1183 transitions. [2025-03-17 13:31:48,268 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1183 transitions. Word has length 2 [2025-03-17 13:31:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:48,268 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1183 transitions. [2025-03-17 13:31:48,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1183 transitions. [2025-03-17 13:31:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:31:48,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:48,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:31:48,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:31:48,269 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-03-17 13:31:48,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1410369413, now seen corresponding path program 1 times [2025-03-17 13:31:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:48,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675898627] [2025-03-17 13:31:48,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:48,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:31:48,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:31:48,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:48,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:49,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:49,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675898627] [2025-03-17 13:31:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675898627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:49,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:49,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:31:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686506555] [2025-03-17 13:31:49,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:49,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:31:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:49,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:31:49,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:31:49,173 INFO L87 Difference]: Start difference. First operand 1029 states and 1183 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:53,206 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-03-17 13:31:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:55,245 INFO L93 Difference]: Finished difference Result 1032 states and 1186 transitions. [2025-03-17 13:31:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:31:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 13:31:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:55,249 INFO L225 Difference]: With dead ends: 1032 [2025-03-17 13:31:55,249 INFO L226 Difference]: Without dead ends: 1032 [2025-03-17 13:31:55,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:31:55,251 INFO L435 NwaCegarLoop]: 1170 mSDtfsCounter, 10 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:55,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2666 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-03-17 13:31:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-17 13:31:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1031. [2025-03-17 13:31:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 554 states have (on average 1.9909747292418774) internal successors, (1103), 984 states have internal predecessors, (1103), 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-03-17 13:31:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1185 transitions. [2025-03-17 13:31:55,276 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1185 transitions. Word has length 5 [2025-03-17 13:31:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:55,277 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1185 transitions. [2025-03-17 13:31:55,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1185 transitions. [2025-03-17 13:31:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:31:55,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:55,277 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:55,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:31:55,277 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-03-17 13:31:55,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:55,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1348504613, now seen corresponding path program 1 times [2025-03-17 13:31:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:55,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80966104] [2025-03-17 13:31:55,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:55,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:55,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:31:55,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:31:55,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:55,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:56,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:56,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80966104] [2025-03-17 13:31:56,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80966104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:56,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547902072] [2025-03-17 13:31:56,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:56,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:56,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:56,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:56,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 13:31:56,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:31:57,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:31:57,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:57,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:57,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 13:31:57,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:57,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:57,475 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-03-17 13:31:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547902072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:57,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:57,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 13:31:57,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567237170] [2025-03-17 13:31:57,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:57,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:31:57,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:57,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:31:57,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:31:57,501 INFO L87 Difference]: Start difference. First operand 1031 states and 1185 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:32:01,526 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-03-17 13:32:05,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:32:09,604 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-03-17 13:32:13,619 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-03-17 13:32:17,653 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-03-17 13:32:21,666 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-03-17 13:32:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:32:26,656 INFO L93 Difference]: Finished difference Result 1034 states and 1189 transitions. [2025-03-17 13:32:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:32:26,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 13:32:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:32:26,662 INFO L225 Difference]: With dead ends: 1034 [2025-03-17 13:32:26,662 INFO L226 Difference]: Without dead ends: 1034 [2025-03-17 13:32:26,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-03-17 13:32:26,663 INFO L435 NwaCegarLoop]: 1168 mSDtfsCounter, 566 mSDsluCounter, 4866 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 10 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 6034 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:32:26,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 6034 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 28.9s Time] [2025-03-17 13:32:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-17 13:32:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1031. [2025-03-17 13:32:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 556 states have (on average 1.9838129496402879) internal successors, (1103), 984 states have internal predecessors, (1103), 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-03-17 13:32:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1185 transitions. [2025-03-17 13:32:26,686 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1185 transitions. Word has length 8 [2025-03-17 13:32:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:32:26,686 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1185 transitions. [2025-03-17 13:32:26,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:32:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1185 transitions. [2025-03-17 13:32:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 13:32:26,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:32:26,686 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 13:32:26,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:32:26,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:32:26,891 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-03-17 13:32:26,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:32:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1824530212, now seen corresponding path program 1 times [2025-03-17 13:32:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:32:26,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476176441] [2025-03-17 13:32:26,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:32:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:32:27,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 13:32:27,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 13:32:27,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:32:27,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:32:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:32:27,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:32:27,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476176441] [2025-03-17 13:32:27,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476176441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:32:27,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358551691] [2025-03-17 13:32:27,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:32:27,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:32:27,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:32:27,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:32:27,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 13:32:28,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 13:32:28,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 13:32:28,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:32:28,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:32:28,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 13:32:28,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:32:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:32:28,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:32:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:32:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358551691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:32:28,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:32:28,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 13:32:28,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014244909] [2025-03-17 13:32:28,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:32:28,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 13:32:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:32:28,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 13:32:28,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:32:28,684 INFO L87 Difference]: Start difference. First operand 1031 states and 1185 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-03-17 13:32:32,709 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-03-17 13:32:36,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:32:40,767 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-03-17 13:32:44,806 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-03-17 13:32:48,837 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-03-17 13:32:52,853 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-03-17 13:32:56,912 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-03-17 13:32:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:32:57,075 INFO L93 Difference]: Finished difference Result 1043 states and 1197 transitions. [2025-03-17 13:32:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:32:57,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 11 [2025-03-17 13:32:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:32:57,081 INFO L225 Difference]: With dead ends: 1043 [2025-03-17 13:32:57,081 INFO L226 Difference]: Without dead ends: 1043 [2025-03-17 13:32:57,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:32:57,082 INFO L435 NwaCegarLoop]: 1174 mSDtfsCounter, 4 mSDsluCounter, 3513 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:32:57,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4687 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 28.4s Time] [2025-03-17 13:32:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2025-03-17 13:32:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2025-03-17 13:32:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 568 states have (on average 1.9630281690140845) internal successors, (1115), 996 states have internal predecessors, (1115), 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-03-17 13:32:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1197 transitions. [2025-03-17 13:32:57,106 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1197 transitions. Word has length 11 [2025-03-17 13:32:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:32:57,106 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1197 transitions. [2025-03-17 13:32:57,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-03-17 13:32:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1197 transitions. [2025-03-17 13:32:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 13:32:57,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:32:57,107 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2025-03-17 13:32:57,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 13:32:57,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:32:57,308 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-03-17 13:32:57,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:32:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash -373702748, now seen corresponding path program 2 times [2025-03-17 13:32:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:32:57,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928167639] [2025-03-17 13:32:57,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:32:57,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:32:57,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 13:32:57,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-17 13:32:57,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:32:57,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:32:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 13:32:58,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:32:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928167639] [2025-03-17 13:32:58,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928167639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:32:58,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:32:58,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:32:58,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607210401] [2025-03-17 13:32:58,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:32:58,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:32:58,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:32:58,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:32:58,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:32:58,266 INFO L87 Difference]: Start difference. First operand 1043 states and 1197 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:33:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:33:03,393 INFO L93 Difference]: Finished difference Result 1826 states and 2114 transitions. [2025-03-17 13:33:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:33:03,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 13:33:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:33:03,399 INFO L225 Difference]: With dead ends: 1826 [2025-03-17 13:33:03,400 INFO L226 Difference]: Without dead ends: 1826 [2025-03-17 13:33:03,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:33:03,401 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 959 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 2624 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:33:03,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 2624 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-17 13:33:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-03-17 13:33:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1042. [2025-03-17 13:33:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 568 states have (on average 1.9612676056338028) internal successors, (1114), 995 states have internal predecessors, (1114), 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-03-17 13:33:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1196 transitions. [2025-03-17 13:33:03,431 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1196 transitions. Word has length 23 [2025-03-17 13:33:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:33:03,431 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1196 transitions. [2025-03-17 13:33:03,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:33:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1196 transitions. [2025-03-17 13:33:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 13:33:03,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:33:03,432 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2025-03-17 13:33:03,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 13:33:03,432 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-03-17 13:33:03,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:33:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash -373702747, now seen corresponding path program 1 times [2025-03-17 13:33:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:33:03,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962829979] [2025-03-17 13:33:03,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:33:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:33:03,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 13:33:03,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 13:33:03,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:33:03,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:33:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:33:04,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:33:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962829979] [2025-03-17 13:33:04,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962829979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:33:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85343244] [2025-03-17 13:33:04,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:33:04,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:33:04,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:33:04,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:33:04,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 13:33:05,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 13:33:05,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 13:33:05,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:33:05,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:33:05,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1803 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 13:33:05,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:33:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:33:05,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:33:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:33:05,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85343244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:33:05,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:33:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-17 13:33:05,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751022045] [2025-03-17 13:33:05,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:33:05,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:33:05,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:33:05,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:33:05,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:33:05,827 INFO L87 Difference]: Start difference. First operand 1042 states and 1196 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)