./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 798a7b37 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-?-798a7b3-m [2025-03-04 09:15:20,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:15:20,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:15:20,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:15:20,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:15:20,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:15:20,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:15:20,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:15:20,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:15:20,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:15:20,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:15:20,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:15:20,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:15:20,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:15:20,616 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:15:20,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:15:20,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:15:20,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:15:20,616 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:15:20,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:15:20,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:15:20,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:15:20,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:15:20,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:15:20,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:15:20,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:15:20,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:15:20,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:15:20,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:15:20,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:15:20,618 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-04 09:15:20,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:15:20,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:15:20,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:15:20,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:15:20,839 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:15:20,840 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-04 09:15:21,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a28872a/99c6f9d6d58449e68dee6713bc3d2c6e/FLAG3e414bb42 [2025-03-04 09:15:22,319 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:15:22,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-04 09:15:22,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a28872a/99c6f9d6d58449e68dee6713bc3d2c6e/FLAG3e414bb42 [2025-03-04 09:15:22,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a28872a/99c6f9d6d58449e68dee6713bc3d2c6e [2025-03-04 09:15:22,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:15:22,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:15:22,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:15:22,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:15:22,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:15:22,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:15:22" (1/1) ... [2025-03-04 09:15:22,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22edf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:22, skipping insertion in model container [2025-03-04 09:15:22,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:15:22" (1/1) ... [2025-03-04 09:15:22,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:15:23,066 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-04 09:15:23,067 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-04 09:15:23,079 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-04 09:15:23,084 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-04 09:15:23,089 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-04 09:15:23,091 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-04 09:15:23,094 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-04 09:15:23,094 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-04 09:15:23,095 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-04 09:15:23,095 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-04 09:15:23,096 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-04 09:15:23,096 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-04 09:15:23,096 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-04 09:15:23,100 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-04 09:15:23,101 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-04 09:15:23,102 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-04 09:15:23,105 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-04 09:15:23,106 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-04 09:15:23,107 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-04 09:15:23,108 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-04 09:15:23,108 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-04 09:15:23,108 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-04 09:15:23,109 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-04 09:15:23,115 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-04 09:15:23,115 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-04 09:15:23,116 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-04 09:15:23,119 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-04 09:15:23,123 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-04 09:15:23,124 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-04 09:15:23,126 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-04 09:15:23,128 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-04 09:15:23,130 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-04 09:15:23,131 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-04 09:15:23,134 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-04 09:15:23,135 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-04 09:15:23,137 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-04 09:15:23,138 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-04 09:15:23,139 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-04 09:15:23,142 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-04 09:15:23,147 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-04 09:15:23,147 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-04 09:15:23,147 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-04 09:15:23,148 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-04 09:15:23,148 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-04 09:15:23,148 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-04 09:15:23,152 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-04 09:15:23,153 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-04 09:15:23,154 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-04 09:15:23,155 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-04 09:15:23,158 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-04 09:15:23,161 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-04 09:15:23,162 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-04 09:15:23,162 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-04 09:15:23,163 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-04 09:15:23,164 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-04 09:15:23,165 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-04 09:15:23,174 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-04 09:15:23,176 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-04 09:15:23,177 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-04 09:15:23,184 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-04 09:15:23,194 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-04 09:15:23,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:15:23,222 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:15:23,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:15:23,466 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 09:15:23,474 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:15:23,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23 WrapperNode [2025-03-04 09:15:23,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:15:23,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:15:23,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:15:23,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:15:23,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,614 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1858 [2025-03-04 09:15:23,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:15:23,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:15:23,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:15:23,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:15:23,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,646 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 09:15:23,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:15:23,738 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:15:23,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:15:23,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:15:23,739 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (1/1) ... [2025-03-04 09:15:23,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:15:23,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:23,765 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-04 09:15:23,768 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-04 09:15:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 09:15:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-04 09:15:23,784 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-04 09:15:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:15:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 09:15:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-04 09:15:23,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-04 09:15:23,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 09:15:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-04 09:15:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:15:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 09:15:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 09:15:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-04 09:15:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-04 09:15:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:15:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-04 09:15:23,785 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 09:15:23,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 09:15:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-04 09:15:23,786 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-04 09:15:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 09:15:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-04 09:15:23,786 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-04 09:15:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-04 09:15:23,786 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-04 09:15:23,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-03-04 09:15:23,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 09:15:23,787 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-04 09:15:23,787 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-04 09:15:24,105 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:15:24,106 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:15:24,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-04 09:15:24,507 INFO L1325 $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-04 09:15:24,564 INFO L1325 $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-04 09:15:24,862 INFO L1325 $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-04 09:15:24,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-04 09:15:24,862 INFO L1325 $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-04 09:15:24,862 INFO L1325 $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-04 09:15:30,118 INFO L1325 $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-04 09:15:30,118 INFO L1325 $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-04 09:15:30,118 INFO L1325 $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-04 09:15:30,301 INFO L? ?]: Removed 1346 outVars from TransFormulas that were not future-live. [2025-03-04 09:15:30,301 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:15:30,376 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:15:30,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:15:30,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:15:30 BoogieIcfgContainer [2025-03-04 09:15:30,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:15:30,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:15:30,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:15:30,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:15:30,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:15:22" (1/3) ... [2025-03-04 09:15:30,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f2cf34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:15:30, skipping insertion in model container [2025-03-04 09:15:30,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:15:23" (2/3) ... [2025-03-04 09:15:30,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f2cf34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:15:30, skipping insertion in model container [2025-03-04 09:15:30,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:15:30" (3/3) ... [2025-03-04 09:15:30,387 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-03-04 09:15:30,400 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:15:30,403 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 1217 locations, 1 initial locations, 23 loop locations, and 494 error locations. [2025-03-04 09:15:30,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:15:30,470 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;@328e858c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:15:30,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 494 error locations. [2025-03-04 09:15:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 1217 states, 656 states have (on average 2.019817073170732) internal successors, (1325), 1165 states have internal predecessors, (1325), 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-04 09:15:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:15:30,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:30,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:15:30,481 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-04 09:15:30,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:30,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1489467, now seen corresponding path program 1 times [2025-03-04 09:15:30,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:30,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043265569] [2025-03-04 09:15:30,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:30,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:31,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:15:31,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:15:31,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:31,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:31,833 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-04 09:15:31,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:31,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043265569] [2025-03-04 09:15:31,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043265569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:31,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:31,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:15:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156800518] [2025-03-04 09:15:31,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:31,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:31,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:31,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:31,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:31,865 INFO L87 Difference]: Start difference. First operand has 1217 states, 656 states have (on average 2.019817073170732) internal successors, (1325), 1165 states have internal predecessors, (1325), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:15:35,922 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-04 09:15:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:37,785 INFO L93 Difference]: Finished difference Result 1368 states and 1563 transitions. [2025-03-04 09:15:37,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:37,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:15:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:37,796 INFO L225 Difference]: With dead ends: 1368 [2025-03-04 09:15:37,796 INFO L226 Difference]: Without dead ends: 1366 [2025-03-04 09:15:37,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:37,798 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 441 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:37,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1618 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 663 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-03-04 09:15:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-04 09:15:37,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1037. [2025-03-04 09:15:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 559 states have (on average 1.9838998211091234) internal successors, (1109), 990 states have internal predecessors, (1109), 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-04 09:15:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1191 transitions. [2025-03-04 09:15:37,877 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1191 transitions. Word has length 3 [2025-03-04 09:15:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:37,877 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1191 transitions. [2025-03-04 09:15:37,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:15:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1191 transitions. [2025-03-04 09:15:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:15:37,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:37,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:15:37,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:15:37,878 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-04 09:15:37,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1489468, now seen corresponding path program 1 times [2025-03-04 09:15:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935070834] [2025-03-04 09:15:37,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:38,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:15:38,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:15:38,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:38,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:38,796 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-04 09:15:38,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:38,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935070834] [2025-03-04 09:15:38,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935070834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:38,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:38,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:15:38,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986089811] [2025-03-04 09:15:38,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:38,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:38,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:38,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:38,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:38,799 INFO L87 Difference]: Start difference. First operand 1037 states and 1191 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:15:42,824 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-04 09:15:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:43,843 INFO L93 Difference]: Finished difference Result 1036 states and 1190 transitions. [2025-03-04 09:15:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:43,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:15:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:43,847 INFO L225 Difference]: With dead ends: 1036 [2025-03-04 09:15:43,847 INFO L226 Difference]: Without dead ends: 1036 [2025-03-04 09:15:43,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:43,848 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 10 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:43,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1932 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-04 09:15:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-03-04 09:15:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2025-03-04 09:15:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 559 states have (on average 1.9821109123434706) internal successors, (1108), 989 states have internal predecessors, (1108), 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-04 09:15:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1190 transitions. [2025-03-04 09:15:43,865 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1190 transitions. Word has length 3 [2025-03-04 09:15:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:43,865 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1190 transitions. [2025-03-04 09:15:43,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:15:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1190 transitions. [2025-03-04 09:15:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:15:43,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:43,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:15:43,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:15:43,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr245REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-03-04 09:15:43,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:43,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1424463197, now seen corresponding path program 1 times [2025-03-04 09:15:43,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:43,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28439396] [2025-03-04 09:15:43,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:43,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:44,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:15:44,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:15:44,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:44,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:44,478 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-04 09:15:44,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:44,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28439396] [2025-03-04 09:15:44,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28439396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:44,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:44,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:15:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597527245] [2025-03-04 09:15:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:44,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:15:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:44,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:15:44,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:15:44,481 INFO L87 Difference]: Start difference. First operand 1036 states and 1190 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:15:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:44,538 INFO L93 Difference]: Finished difference Result 1039 states and 1194 transitions. [2025-03-04 09:15:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:15:44,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 09:15:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:44,542 INFO L225 Difference]: With dead ends: 1039 [2025-03-04 09:15:44,542 INFO L226 Difference]: Without dead ends: 1039 [2025-03-04 09:15:44,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-04 09:15:44,543 INFO L435 NwaCegarLoop]: 1182 mSDtfsCounter, 2 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:44,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2361 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:15:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-03-04 09:15:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1037. [2025-03-04 09:15:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 560 states have (on average 1.980357142857143) internal successors, (1109), 990 states have internal predecessors, (1109), 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-04 09:15:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1191 transitions. [2025-03-04 09:15:44,561 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1191 transitions. Word has length 6 [2025-03-04 09:15:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:44,561 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1191 transitions. [2025-03-04 09:15:44,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:15:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1191 transitions. [2025-03-04 09:15:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:15:44,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:44,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:15:44,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:15:44,562 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-04 09:15:44,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1424463358, now seen corresponding path program 1 times [2025-03-04 09:15:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:44,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198504413] [2025-03-04 09:15:44,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:44,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:44,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:15:44,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:15:44,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:44,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:45,523 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-04 09:15:45,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:45,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198504413] [2025-03-04 09:15:45,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198504413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:15:45,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:15:45,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:15:45,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959025352] [2025-03-04 09:15:45,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:15:45,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:15:45,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:45,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:15:45,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:15:45,524 INFO L87 Difference]: Start difference. First operand 1037 states and 1191 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:15:49,552 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-04 09:15:53,590 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-04 09:15:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:55,244 INFO L93 Difference]: Finished difference Result 1039 states and 1193 transitions. [2025-03-04 09:15:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:15:55,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 09:15:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:55,247 INFO L225 Difference]: With dead ends: 1039 [2025-03-04 09:15:55,249 INFO L226 Difference]: Without dead ends: 1039 [2025-03-04 09:15:55,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:15:55,250 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 10 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:55,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2685 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 870 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2025-03-04 09:15:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-03-04 09:15:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1038. [2025-03-04 09:15:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 561 states have (on average 1.9786096256684491) internal successors, (1110), 991 states have internal predecessors, (1110), 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-04 09:15:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1192 transitions. [2025-03-04 09:15:55,276 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1192 transitions. Word has length 6 [2025-03-04 09:15:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:55,276 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1192 transitions. [2025-03-04 09:15:55,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:15:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1192 transitions. [2025-03-04 09:15:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:15:55,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:55,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:55,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:15:55,277 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-04 09:15:55,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1912403862, now seen corresponding path program 1 times [2025-03-04 09:15:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:55,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308571069] [2025-03-04 09:15:55,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:55,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:55,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:15:55,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:15:55,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:55,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:15:55,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:55,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308571069] [2025-03-04 09:15:55,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308571069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:15:55,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680808438] [2025-03-04 09:15:55,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:55,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:55,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:55,959 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-04 09:15:55,961 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-04 09:15:56,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:15:56,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:15:56,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:56,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:56,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:15:56,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:15:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:15:56,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:15:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:15:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680808438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:15:56,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:15:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:15:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441036590] [2025-03-04 09:15:56,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:15:56,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:15:56,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:56,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:15:56,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:56,875 INFO L87 Difference]: Start difference. First operand 1038 states and 1192 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-04 09:15:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:15:57,026 INFO L93 Difference]: Finished difference Result 1046 states and 1202 transitions. [2025-03-04 09:15:57,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:15:57,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:15:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:15:57,031 INFO L225 Difference]: With dead ends: 1046 [2025-03-04 09:15:57,031 INFO L226 Difference]: Without dead ends: 1046 [2025-03-04 09:15:57,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:15:57,033 INFO L435 NwaCegarLoop]: 1182 mSDtfsCounter, 4 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:15:57,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2361 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:15:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-04 09:15:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-03-04 09:15:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 569 states have (on average 1.968365553602812) internal successors, (1120), 999 states have internal predecessors, (1120), 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-04 09:15:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1202 transitions. [2025-03-04 09:15:57,052 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1202 transitions. Word has length 9 [2025-03-04 09:15:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:15:57,053 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1202 transitions. [2025-03-04 09:15:57,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-04 09:15:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1202 transitions. [2025-03-04 09:15:57,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:15:57,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:15:57,053 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:15:57,088 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-04 09:15:57,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:57,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr248REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-03-04 09:15:57,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:15:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1912404023, now seen corresponding path program 1 times [2025-03-04 09:15:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:15:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153598957] [2025-03-04 09:15:57,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:15:57,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:15:57,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:15:57,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:57,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:58,233 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-04 09:15:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:15:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153598957] [2025-03-04 09:15:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153598957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:15:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120245565] [2025-03-04 09:15:58,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:15:58,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:15:58,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:15:58,237 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-04 09:15:58,238 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-04 09:15:59,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:15:59,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:15:59,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:15:59,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:15:59,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:15:59,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:15:59,295 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-04 09:15:59,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:15:59,430 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-04 09:15:59,446 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-04 09:15:59,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120245565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:15:59,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:15:59,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 09:15:59,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609358705] [2025-03-04 09:15:59,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:15:59,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:15:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:15:59,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:15:59,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:15:59,448 INFO L87 Difference]: Start difference. First operand 1046 states and 1202 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:16:03,471 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-04 09:16:07,533 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-04 09:16:11,544 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-04 09:16:15,565 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-04 09:16:19,573 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-04 09:16:23,606 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-04 09:16:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:16:27,076 INFO L93 Difference]: Finished difference Result 1045 states and 1199 transitions. [2025-03-04 09:16:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:16:27,076 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:16:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:16:27,081 INFO L225 Difference]: With dead ends: 1045 [2025-03-04 09:16:27,081 INFO L226 Difference]: Without dead ends: 1045 [2025-03-04 09:16:27,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:16:27,081 INFO L435 NwaCegarLoop]: 1175 mSDtfsCounter, 547 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 4694 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:16:27,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 4694 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1363 Invalid, 6 Unknown, 0 Unchecked, 27.5s Time] [2025-03-04 09:16:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-04 09:16:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1045. [2025-03-04 09:16:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 569 states have (on average 1.9630931458699472) internal successors, (1117), 998 states have internal predecessors, (1117), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 09:16:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1199 transitions. [2025-03-04 09:16:27,103 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1199 transitions. Word has length 9 [2025-03-04 09:16:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:16:27,103 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1199 transitions. [2025-03-04 09:16:27,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:16:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1199 transitions. [2025-03-04 09:16:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:16:27,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:16:27,104 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:16:27,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:16:27,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 09:16:27,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr245REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-03-04 09:16:27,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:16:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1558732829, now seen corresponding path program 2 times [2025-03-04 09:16:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:16:27,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911943654] [2025-03-04 09:16:27,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:16:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:16:27,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 09:16:27,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 09:16:27,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:16:27,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:16:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 09:16:28,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:16:28,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911943654] [2025-03-04 09:16:28,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911943654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:16:28,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:16:28,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:16:28,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839322245] [2025-03-04 09:16:28,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:16:28,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:16:28,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:16:28,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:16:28,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:16:28,317 INFO L87 Difference]: Start difference. First operand 1045 states and 1199 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:16:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:16:31,195 INFO L93 Difference]: Finished difference Result 1832 states and 2120 transitions. [2025-03-04 09:16:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:16:31,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:16:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:16:31,202 INFO L225 Difference]: With dead ends: 1832 [2025-03-04 09:16:31,202 INFO L226 Difference]: Without dead ends: 1832 [2025-03-04 09:16:31,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:16:31,203 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 989 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:16:31,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 2765 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 09:16:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2025-03-04 09:16:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1044. [2025-03-04 09:16:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 569 states have (on average 1.961335676625659) internal successors, (1116), 997 states have internal predecessors, (1116), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 09:16:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1198 transitions. [2025-03-04 09:16:31,235 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1198 transitions. Word has length 18 [2025-03-04 09:16:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:16:31,235 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1198 transitions. [2025-03-04 09:16:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:16:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1198 transitions. [2025-03-04 09:16:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:16:31,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:16:31,236 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:16:31,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:16:31,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr246REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-03-04 09:16:31,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:16:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1558732830, now seen corresponding path program 1 times [2025-03-04 09:16:31,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:16:31,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916561910] [2025-03-04 09:16:31,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:16:31,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:16:31,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:16:31,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:16:31,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:16:31,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:16:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:16:31,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:16:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916561910] [2025-03-04 09:16:31,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916561910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:16:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965292940] [2025-03-04 09:16:31,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:16:31,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:16:31,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:16:31,969 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-04 09:16:31,970 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-04 09:16:32,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:16:32,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:16:32,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:16:32,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:16:32,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:16:32,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:16:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:16:32,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:16:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:16:33,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965292940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:16:33,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:16:33,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 09:16:33,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434063554] [2025-03-04 09:16:33,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:16:33,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:16:33,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:16:33,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:16:33,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:16:33,074 INFO L87 Difference]: Start difference. First operand 1044 states and 1198 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-04 09:16:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:16:33,204 INFO L93 Difference]: Finished difference Result 1062 states and 1216 transitions. [2025-03-04 09:16:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:16:33,207 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 18 [2025-03-04 09:16:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:16:33,211 INFO L225 Difference]: With dead ends: 1062 [2025-03-04 09:16:33,211 INFO L226 Difference]: Without dead ends: 1062 [2025-03-04 09:16:33,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:16:33,212 INFO L435 NwaCegarLoop]: 1181 mSDtfsCounter, 4 mSDsluCounter, 4712 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5893 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:16:33,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5893 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:16:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-03-04 09:16:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2025-03-04 09:16:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 587 states have (on average 1.9318568994889267) internal successors, (1134), 1015 states have internal predecessors, (1134), 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-04 09:16:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1216 transitions. [2025-03-04 09:16:33,240 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1216 transitions. Word has length 18 [2025-03-04 09:16:33,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:16:33,240 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1216 transitions. [2025-03-04 09:16:33,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-04 09:16:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1216 transitions. [2025-03-04 09:16:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:16:33,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:16:33,240 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 09:16:33,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:16:33,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:16:33,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr246REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-03-04 09:16:33,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:16:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash 96965694, now seen corresponding path program 2 times [2025-03-04 09:16:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:16:33,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322712303] [2025-03-04 09:16:33,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:16:33,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:16:34,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:16:34,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-04 09:16:34,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:16:34,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:16:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:16:34,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:16:34,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322712303] [2025-03-04 09:16:34,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322712303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:16:34,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:16:34,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:16:34,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382615249] [2025-03-04 09:16:34,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:16:34,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:16:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:16:34,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:16:34,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:16:34,624 INFO L87 Difference]: Start difference. First operand 1062 states and 1216 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:16:38,646 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-04 09:16:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:16:43,801 INFO L93 Difference]: Finished difference Result 2513 states and 2894 transitions. [2025-03-04 09:16:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:16:43,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-04 09:16:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:16:43,809 INFO L225 Difference]: With dead ends: 2513 [2025-03-04 09:16:43,809 INFO L226 Difference]: Without dead ends: 2513 [2025-03-04 09:16:43,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:16:43,811 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 3481 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 146 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3484 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1834 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:16:43,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3484 Valid, 1835 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1834 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2025-03-04 09:16:43,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-03-04 09:16:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 1816. [2025-03-04 09:16:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1295 states have (on average 2.0084942084942083) internal successors, (2601), 1727 states have internal predecessors, (2601), 81 states have call successors, (81), 27 states have call predecessors, (81), 26 states have return successors, (78), 63 states have call predecessors, (78), 67 states have call successors, (78) [2025-03-04 09:16:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2760 transitions. [2025-03-04 09:16:43,849 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2760 transitions. Word has length 36 [2025-03-04 09:16:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:16:43,849 INFO L471 AbstractCegarLoop]: Abstraction has 1816 states and 2760 transitions. [2025-03-04 09:16:43,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:16:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2760 transitions. [2025-03-04 09:16:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:16:43,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:16:43,850 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:16:43,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:16:43,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr243REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-03-04 09:16:43,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:16:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2013562257, now seen corresponding path program 1 times [2025-03-04 09:16:43,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:16:43,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423341083] [2025-03-04 09:16:43,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:16:43,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:16:44,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:16:44,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:16:44,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:16:44,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:16:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:16:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:16:44,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423341083] [2025-03-04 09:16:44,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423341083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:16:44,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:16:44,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:16:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750063094] [2025-03-04 09:16:44,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:16:44,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:16:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:16:44,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:16:44,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:16:44,736 INFO L87 Difference]: Start difference. First operand 1816 states and 2760 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:16:48,768 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-04 09:16:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:16:50,409 INFO L93 Difference]: Finished difference Result 1976 states and 2756 transitions. [2025-03-04 09:16:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:16:50,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-04 09:16:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:16:50,415 INFO L225 Difference]: With dead ends: 1976 [2025-03-04 09:16:50,415 INFO L226 Difference]: Without dead ends: 1976 [2025-03-04 09:16:50,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:16:50,416 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 421 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-04 09:16:50,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1623 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 660 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2025-03-04 09:16:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2025-03-04 09:16:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1811. [2025-03-04 09:16:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1295 states have (on average 2.0046332046332047) internal successors, (2596), 1722 states have internal predecessors, (2596), 81 states have call successors, (81), 27 states have call predecessors, (81), 26 states have return successors, (78), 63 states have call predecessors, (78), 67 states have call successors, (78) [2025-03-04 09:16:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2755 transitions. [2025-03-04 09:16:50,442 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2755 transitions. Word has length 44 [2025-03-04 09:16:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:16:50,443 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2755 transitions. [2025-03-04 09:16:50,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:16:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2755 transitions. [2025-03-04 09:16:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:16:50,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:16:50,444 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:16:50,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:16:50,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr244REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-03-04 09:16:50,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:16:50,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2013562256, now seen corresponding path program 1 times [2025-03-04 09:16:50,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:16:50,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227118251] [2025-03-04 09:16:50,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:16:50,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:16:50,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:16:50,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:16:50,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:16:50,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:16:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:16:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:16:51,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227118251] [2025-03-04 09:16:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227118251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:16:51,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:16:51,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:16:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107204143] [2025-03-04 09:16:51,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:16:51,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:16:51,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:16:51,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:16:51,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:16:51,844 INFO L87 Difference]: Start difference. First operand 1811 states and 2755 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:16:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:16:52,871 INFO L93 Difference]: Finished difference Result 1811 states and 2756 transitions. [2025-03-04 09:16:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:16:52,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-04 09:16:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:16:52,878 INFO L225 Difference]: With dead ends: 1811 [2025-03-04 09:16:52,878 INFO L226 Difference]: Without dead ends: 1811 [2025-03-04 09:16:52,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:16:52,879 INFO L435 NwaCegarLoop]: 1168 mSDtfsCounter, 500 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 4429 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:16:52,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 4429 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 09:16:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-03-04 09:16:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1810. [2025-03-04 09:16:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1295 states have (on average 2.003861003861004) internal successors, (2595), 1721 states have internal predecessors, (2595), 81 states have call successors, (81), 27 states have call predecessors, (81), 26 states have return successors, (78), 63 states have call predecessors, (78), 67 states have call successors, (78) [2025-03-04 09:16:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2754 transitions. [2025-03-04 09:16:52,907 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2754 transitions. Word has length 44 [2025-03-04 09:16:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:16:52,907 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2754 transitions. [2025-03-04 09:16:52,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:16:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2754 transitions. [2025-03-04 09:16:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:16:52,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:16:52,909 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:16:52,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:16:52,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr242REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-03-04 09:16:52,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:16:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1776433978, now seen corresponding path program 1 times [2025-03-04 09:16:52,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:16:52,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443370775] [2025-03-04 09:16:52,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:16:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:16:53,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:16:53,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:16:53,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:16:53,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:16:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:16:53,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:16:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443370775] [2025-03-04 09:16:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443370775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:16:53,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:16:53,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:16:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671347147] [2025-03-04 09:16:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:16:53,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:16:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:16:53,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:16:53,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:16:53,830 INFO L87 Difference]: Start difference. First operand 1810 states and 2754 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)