./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 00:27:59,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:27:59,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:27:59,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:27:59,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:27:59,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:27:59,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:27:59,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:27:59,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:27:59,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:27:59,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:27:59,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:27:59,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:27:59,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:27:59,822 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:27:59,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:27:59,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:27:59,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:27:59,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:27:59,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:27:59,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:27:59,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:27:59,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:27:59,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:27:59,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:27:59,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:27:59,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:27:59,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:27:59,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:27:59,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:27:59,825 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-09 00:28:00,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:28:00,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:28:00,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:28:00,054 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:28:00,054 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:28:00,055 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-09 00:28:01,162 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62f6275c/7821a335ee9c4dcca7b24cdebebc9ab4/FLAGd9615b0c2 [2025-03-09 00:28:01,536 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:28:01,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-09 00:28:01,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62f6275c/7821a335ee9c4dcca7b24cdebebc9ab4/FLAGd9615b0c2 [2025-03-09 00:28:01,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62f6275c/7821a335ee9c4dcca7b24cdebebc9ab4 [2025-03-09 00:28:01,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:28:01,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:28:01,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:28:01,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:28:01,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:28:01,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:28:01" (1/1) ... [2025-03-09 00:28:01,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b29ee00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:01, skipping insertion in model container [2025-03-09 00:28:01,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:28:01" (1/1) ... [2025-03-09 00:28:01,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:28:02,401 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-09 00:28:02,402 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-09 00:28:02,414 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-09 00:28:02,417 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-09 00:28:02,419 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-09 00:28:02,420 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-09 00:28:02,421 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-09 00:28:02,421 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-09 00:28:02,422 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-09 00:28:02,422 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-09 00:28:02,423 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-09 00:28:02,423 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-09 00:28:02,423 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-09 00:28:02,425 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-09 00:28:02,425 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-09 00:28:02,426 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-09 00:28:02,427 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-09 00:28:02,428 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-09 00:28:02,428 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-09 00:28:02,428 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-09 00:28:02,429 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-09 00:28:02,429 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-09 00:28:02,429 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-09 00:28:02,431 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-09 00:28:02,431 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-09 00:28:02,431 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-09 00:28:02,434 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-09 00:28:02,437 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-09 00:28:02,438 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-09 00:28:02,438 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-09 00:28:02,440 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-09 00:28:02,441 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-09 00:28:02,442 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-09 00:28:02,443 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-09 00:28:02,446 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-09 00:28:02,447 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-09 00:28:02,448 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-09 00:28:02,454 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-09 00:28:02,455 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-09 00:28:02,461 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-09 00:28:02,462 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-09 00:28:02,462 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-09 00:28:02,463 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-09 00:28:02,463 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-09 00:28:02,464 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-09 00:28:02,467 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-09 00:28:02,471 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-09 00:28:02,472 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-09 00:28:02,473 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-09 00:28:02,476 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-09 00:28:02,479 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-09 00:28:02,480 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-09 00:28:02,480 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-09 00:28:02,481 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-09 00:28:02,481 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-09 00:28:02,483 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-09 00:28:02,490 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-09 00:28:02,491 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-09 00:28:02,492 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-09 00:28:02,496 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-09 00:28:02,505 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-09 00:28:02,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:28:02,541 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:28:02,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:28:02,771 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 00:28:02,777 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:28:02,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02 WrapperNode [2025-03-09 00:28:02,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:28:02,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:28:02,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:28:02,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:28:02,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,878 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1858 [2025-03-09 00:28:02,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:28:02,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:28:02,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:28:02,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:28:02,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,906 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 00:28:02,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:28:02,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:28:02,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:28:02,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:28:02,994 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (1/1) ... [2025-03-09 00:28:02,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:28:03,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:03,022 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-09 00:28:03,024 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-09 00:28:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-09 00:28:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-09 00:28:03,045 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-09 00:28:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:28:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-09 00:28:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-09 00:28:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-09 00:28:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 00:28:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 00:28:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 00:28:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 00:28:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 00:28:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-09 00:28:03,047 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-09 00:28:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-09 00:28:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:28:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:28:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 00:28:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:28:03,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:28:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-09 00:28:03,048 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-09 00:28:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 00:28:03,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 00:28:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 00:28:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 00:28:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-09 00:28:03,048 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-09 00:28:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-09 00:28:03,049 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-09 00:28:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:28:03,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:28:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-09 00:28:03,049 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-09 00:28:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:28:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 00:28:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 00:28:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-09 00:28:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-09 00:28:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 00:28:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-09 00:28:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-09 00:28:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-09 00:28:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-09 00:28:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-03-09 00:28:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 00:28:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-09 00:28:03,051 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-09 00:28:03,421 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:28:03,424 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:28:03,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-09 00:28:03,851 INFO L1307 $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-09 00:28:03,908 INFO L1307 $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-09 00:28:04,195 INFO L1307 $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-09 00:28:04,195 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-09 00:28:04,195 INFO L1307 $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-09 00:28:04,195 INFO L1307 $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-09 00:28:09,516 INFO L1307 $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-09 00:28:09,516 INFO L1307 $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-09 00:28:09,516 INFO L1307 $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-09 00:28:09,679 INFO L? ?]: Removed 1346 outVars from TransFormulas that were not future-live. [2025-03-09 00:28:09,679 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:28:09,713 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:28:09,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:28:09,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:28:09 BoogieIcfgContainer [2025-03-09 00:28:09,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:28:09,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:28:09,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:28:09,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:28:09,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:28:01" (1/3) ... [2025-03-09 00:28:09,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561d9318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:28:09, skipping insertion in model container [2025-03-09 00:28:09,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:02" (2/3) ... [2025-03-09 00:28:09,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561d9318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:28:09, skipping insertion in model container [2025-03-09 00:28:09,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:28:09" (3/3) ... [2025-03-09 00:28:09,728 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-03-09 00:28:09,740 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:28:09,744 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-09 00:28:09,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:28:09,802 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;@44d5470a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:28:09,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 494 error locations. [2025-03-09 00:28:09,809 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-09 00:28:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:28:09,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:09,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:28:09,814 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-09 00:28:09,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1489467, now seen corresponding path program 1 times [2025-03-09 00:28:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:09,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528282962] [2025-03-09 00:28:09,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:10,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:28:10,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:28:10,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:10,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:10,963 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-09 00:28:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528282962] [2025-03-09 00:28:10,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528282962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:10,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:10,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:10,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879798328] [2025-03-09 00:28:10,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:10,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:10,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:10,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:10,992 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-09 00:28:15,037 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-09 00:28:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:16,703 INFO L93 Difference]: Finished difference Result 1368 states and 1563 transitions. [2025-03-09 00:28:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:16,705 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-09 00:28:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:16,719 INFO L225 Difference]: With dead ends: 1368 [2025-03-09 00:28:16,719 INFO L226 Difference]: Without dead ends: 1366 [2025-03-09 00:28:16,720 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-09 00:28:16,723 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 441 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:16,724 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.6s Time] [2025-03-09 00:28:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-09 00:28:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1037. [2025-03-09 00:28:16,797 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-09 00:28:16,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1191 transitions. [2025-03-09 00:28:16,806 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1191 transitions. Word has length 3 [2025-03-09 00:28:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:16,806 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1191 transitions. [2025-03-09 00:28:16,807 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-09 00:28:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1191 transitions. [2025-03-09 00:28:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:28:16,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:16,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:28:16,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:28:16,807 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-09 00:28:16,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1489468, now seen corresponding path program 1 times [2025-03-09 00:28:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142121336] [2025-03-09 00:28:16,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:17,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:28:17,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:28:17,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:17,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:17,734 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-09 00:28:17,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:17,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142121336] [2025-03-09 00:28:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142121336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:17,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688859084] [2025-03-09 00:28:17,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:17,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:17,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:17,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:17,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:17,737 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-09 00:28:21,761 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-09 00:28:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:22,919 INFO L93 Difference]: Finished difference Result 1036 states and 1190 transitions. [2025-03-09 00:28:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:22,919 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-09 00:28:22,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:22,922 INFO L225 Difference]: With dead ends: 1036 [2025-03-09 00:28:22,923 INFO L226 Difference]: Without dead ends: 1036 [2025-03-09 00:28:22,923 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-09 00:28:22,923 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 10 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:22,924 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.1s Time] [2025-03-09 00:28:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-03-09 00:28:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2025-03-09 00:28:22,942 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-09 00:28:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1190 transitions. [2025-03-09 00:28:22,946 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1190 transitions. Word has length 3 [2025-03-09 00:28:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:22,946 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1190 transitions. [2025-03-09 00:28:22,946 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-09 00:28:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1190 transitions. [2025-03-09 00:28:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:28:22,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:22,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:28:22,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:28:22,946 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-09 00:28:22,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1424463197, now seen corresponding path program 1 times [2025-03-09 00:28:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:22,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115243503] [2025-03-09 00:28:22,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:23,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:28:23,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:28:23,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:23,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:23,592 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-09 00:28:23,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115243503] [2025-03-09 00:28:23,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115243503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:23,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:23,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:28:23,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110241572] [2025-03-09 00:28:23,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:23,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:23,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:23,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:23,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:23,595 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-09 00:28:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:23,652 INFO L93 Difference]: Finished difference Result 1039 states and 1194 transitions. [2025-03-09 00:28:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:23,653 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-09 00:28:23,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:23,656 INFO L225 Difference]: With dead ends: 1039 [2025-03-09 00:28:23,656 INFO L226 Difference]: Without dead ends: 1039 [2025-03-09 00:28:23,656 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-09 00:28:23,659 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-09 00:28:23,659 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-09 00:28:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-03-09 00:28:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1037. [2025-03-09 00:28:23,677 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-09 00:28:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1191 transitions. [2025-03-09 00:28:23,682 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1191 transitions. Word has length 6 [2025-03-09 00:28:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:23,684 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1191 transitions. [2025-03-09 00:28:23,684 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-09 00:28:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1191 transitions. [2025-03-09 00:28:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:28:23,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:23,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:28:23,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:28:23,685 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-09 00:28:23,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1424463358, now seen corresponding path program 1 times [2025-03-09 00:28:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:23,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807901754] [2025-03-09 00:28:23,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:23,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:24,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:28:24,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:28:24,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:24,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:24,640 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-09 00:28:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:24,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807901754] [2025-03-09 00:28:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807901754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:24,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:24,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:28:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237566470] [2025-03-09 00:28:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:24,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:28:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:24,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:28:24,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:28:24,641 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-09 00:28:28,666 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-09 00:28:32,709 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-09 00:28:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:34,577 INFO L93 Difference]: Finished difference Result 1039 states and 1193 transitions. [2025-03-09 00:28:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:28:34,578 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-09 00:28:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:34,581 INFO L225 Difference]: With dead ends: 1039 [2025-03-09 00:28:34,581 INFO L226 Difference]: Without dead ends: 1039 [2025-03-09 00:28:34,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:28:34,584 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 10 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s 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.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:34,585 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.9s Time] [2025-03-09 00:28:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-03-09 00:28:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1038. [2025-03-09 00:28:34,603 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-09 00:28:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1192 transitions. [2025-03-09 00:28:34,608 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1192 transitions. Word has length 6 [2025-03-09 00:28:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:34,608 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1192 transitions. [2025-03-09 00:28:34,608 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-09 00:28:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1192 transitions. [2025-03-09 00:28:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:28:34,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:34,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:34,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:28:34,609 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-09 00:28:34,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1912403862, now seen corresponding path program 1 times [2025-03-09 00:28:34,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:34,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162439074] [2025-03-09 00:28:34,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:34,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:35,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:28:35,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:28:35,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:35,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:35,412 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-09 00:28:35,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162439074] [2025-03-09 00:28:35,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162439074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:28:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738096383] [2025-03-09 00:28:35,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:35,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:35,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:35,416 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-09 00:28:35,417 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-09 00:28:36,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:28:36,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:28:36,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:36,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:36,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:28:36,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:36,358 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-09 00:28:36,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:36,414 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-09 00:28:36,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738096383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:36,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:28:36,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:28:36,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995782619] [2025-03-09 00:28:36,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:36,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:28:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:36,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:28:36,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:28:36,415 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-09 00:28:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:36,518 INFO L93 Difference]: Finished difference Result 1046 states and 1202 transitions. [2025-03-09 00:28:36,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:28:36,519 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-09 00:28:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:36,523 INFO L225 Difference]: With dead ends: 1046 [2025-03-09 00:28:36,524 INFO L226 Difference]: Without dead ends: 1046 [2025-03-09 00:28:36,524 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-09 00:28:36,524 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-09 00:28:36,524 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-09 00:28:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-09 00:28:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-03-09 00:28:36,542 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-09 00:28:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1202 transitions. [2025-03-09 00:28:36,546 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1202 transitions. Word has length 9 [2025-03-09 00:28:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:36,546 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1202 transitions. [2025-03-09 00:28:36,546 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-09 00:28:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1202 transitions. [2025-03-09 00:28:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:28:36,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:36,546 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:36,558 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-09 00:28:36,751 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-09 00:28:36,751 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-09 00:28:36,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:36,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1912404023, now seen corresponding path program 1 times [2025-03-09 00:28:36,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:36,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690749477] [2025-03-09 00:28:36,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:37,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:28:37,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:28:37,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:37,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:37,737 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-09 00:28:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690749477] [2025-03-09 00:28:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690749477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:28:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416678385] [2025-03-09 00:28:37,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:28:37,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:37,739 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-09 00:28:37,740 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-09 00:28:38,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:28:38,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:28:38,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:38,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:38,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:28:38,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:28:38,716 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-09 00:28:38,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:28:38,900 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-09 00:28:38,926 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-09 00:28:38,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416678385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:28:38,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:28:38,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:28:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997815811] [2025-03-09 00:28:38,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:28:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:28:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:38,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:28:38,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:28:38,927 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-09 00:28:42,962 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-09 00:28:46,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:50,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 00:28:54,997 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-09 00:28:59,035 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-09 00:29:03,057 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-09 00:29:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:05,775 INFO L93 Difference]: Finished difference Result 1045 states and 1199 transitions. [2025-03-09 00:29:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:29:05,776 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-09 00:29:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:05,779 INFO L225 Difference]: With dead ends: 1045 [2025-03-09 00:29:05,779 INFO L226 Difference]: Without dead ends: 1045 [2025-03-09 00:29:05,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:29:05,780 INFO L435 NwaCegarLoop]: 1175 mSDtfsCounter, 547 mSDsluCounter, 3519 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s 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, 26.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:05,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 4694 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1363 Invalid, 6 Unknown, 0 Unchecked, 26.7s Time] [2025-03-09 00:29:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-09 00:29:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1045. [2025-03-09 00:29:05,793 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-09 00:29:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1199 transitions. [2025-03-09 00:29:05,796 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1199 transitions. Word has length 9 [2025-03-09 00:29:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:05,797 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1199 transitions. [2025-03-09 00:29:05,797 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-09 00:29:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1199 transitions. [2025-03-09 00:29:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:29:05,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:05,798 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:05,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:29:05,998 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-09 00:29:05,999 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-09 00:29:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1558732829, now seen corresponding path program 2 times [2025-03-09 00:29:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031199937] [2025-03-09 00:29:05,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:06,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:29:06,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 00:29:06,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:29:06,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:06,935 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-09 00:29:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:06,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031199937] [2025-03-09 00:29:06,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031199937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:06,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:29:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150636105] [2025-03-09 00:29:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:06,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:29:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:06,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:29:06,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:06,936 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-09 00:29:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:09,003 INFO L93 Difference]: Finished difference Result 1832 states and 2120 transitions. [2025-03-09 00:29:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:09,004 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-09 00:29:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:09,009 INFO L225 Difference]: With dead ends: 1832 [2025-03-09 00:29:09,009 INFO L226 Difference]: Without dead ends: 1832 [2025-03-09 00:29:09,009 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-09 00:29:09,009 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 989 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:09,010 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.0s Time] [2025-03-09 00:29:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2025-03-09 00:29:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1044. [2025-03-09 00:29:09,029 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-09 00:29:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1198 transitions. [2025-03-09 00:29:09,031 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1198 transitions. Word has length 18 [2025-03-09 00:29:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:09,032 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1198 transitions. [2025-03-09 00:29:09,032 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-09 00:29:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1198 transitions. [2025-03-09 00:29:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:29:09,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:09,032 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:09,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:29:09,032 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-09 00:29:09,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:09,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1558732830, now seen corresponding path program 1 times [2025-03-09 00:29:09,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:09,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497170764] [2025-03-09 00:29:09,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:09,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:09,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:29:09,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:29:09,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:09,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:09,815 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-09 00:29:09,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:09,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497170764] [2025-03-09 00:29:09,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497170764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:09,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143291396] [2025-03-09 00:29:09,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:09,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:09,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:09,818 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-09 00:29:09,820 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-09 00:29:10,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:29:10,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:29:10,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:10,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:10,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:29:10,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:10,772 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-09 00:29:10,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:10,880 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-09 00:29:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143291396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:10,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:10,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:29:10,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311780428] [2025-03-09 00:29:10,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:10,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:29:10,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:10,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:29:10,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:29:10,882 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-09 00:29:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:10,979 INFO L93 Difference]: Finished difference Result 1062 states and 1216 transitions. [2025-03-09 00:29:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:29:10,980 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-09 00:29:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:10,982 INFO L225 Difference]: With dead ends: 1062 [2025-03-09 00:29:10,982 INFO L226 Difference]: Without dead ends: 1062 [2025-03-09 00:29:10,982 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-09 00:29:10,982 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-09 00:29:10,983 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-09 00:29:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-03-09 00:29:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2025-03-09 00:29:10,998 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-09 00:29:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1216 transitions. [2025-03-09 00:29:11,000 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1216 transitions. Word has length 18 [2025-03-09 00:29:11,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:11,000 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1216 transitions. [2025-03-09 00:29:11,001 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-09 00:29:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1216 transitions. [2025-03-09 00:29:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:29:11,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:11,002 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:11,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:29:11,202 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-09 00:29:11,202 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-09 00:29:11,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash 96965694, now seen corresponding path program 2 times [2025-03-09 00:29:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311742388] [2025-03-09 00:29:11,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:11,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:29:11,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-09 00:29:11,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:29:11,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:12,291 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-09 00:29:12,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:12,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311742388] [2025-03-09 00:29:12,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311742388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:12,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:12,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:29:12,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723538505] [2025-03-09 00:29:12,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:12,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:29:12,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:12,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:29:12,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:29:12,293 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-09 00:29:16,331 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-09 00:29:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:19,841 INFO L93 Difference]: Finished difference Result 2513 states and 2894 transitions. [2025-03-09 00:29:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:19,841 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-09 00:29:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:19,847 INFO L225 Difference]: With dead ends: 2513 [2025-03-09 00:29:19,847 INFO L226 Difference]: Without dead ends: 2513 [2025-03-09 00:29:19,847 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-09 00:29:19,847 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 3481 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1834 mSolverCounterSat, 146 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s 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, 7.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:19,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3484 Valid, 1835 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1834 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2025-03-09 00:29:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-03-09 00:29:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 1816. [2025-03-09 00:29:19,876 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-09 00:29:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2760 transitions. [2025-03-09 00:29:19,880 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2760 transitions. Word has length 36 [2025-03-09 00:29:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:19,880 INFO L471 AbstractCegarLoop]: Abstraction has 1816 states and 2760 transitions. [2025-03-09 00:29:19,880 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-09 00:29:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2760 transitions. [2025-03-09 00:29:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:29:19,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:19,882 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:19,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:29:19,882 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-09 00:29:19,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:19,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2013562257, now seen corresponding path program 1 times [2025-03-09 00:29:19,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:19,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182128847] [2025-03-09 00:29:19,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:19,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:20,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:29:20,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:29:20,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:20,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:20,664 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-09 00:29:20,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182128847] [2025-03-09 00:29:20,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182128847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:20,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:20,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:29:20,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990557864] [2025-03-09 00:29:20,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:20,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:29:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:20,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:29:20,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:20,666 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-09 00:29:24,689 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-09 00:29:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:25,844 INFO L93 Difference]: Finished difference Result 1976 states and 2756 transitions. [2025-03-09 00:29:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:25,844 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-09 00:29:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:25,849 INFO L225 Difference]: With dead ends: 1976 [2025-03-09 00:29:25,850 INFO L226 Difference]: Without dead ends: 1976 [2025-03-09 00:29:25,850 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-09 00:29:25,850 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 421 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:25,850 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.1s Time] [2025-03-09 00:29:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2025-03-09 00:29:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1811. [2025-03-09 00:29:25,870 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-09 00:29:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2755 transitions. [2025-03-09 00:29:25,873 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2755 transitions. Word has length 44 [2025-03-09 00:29:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:25,874 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2755 transitions. [2025-03-09 00:29:25,874 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-09 00:29:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2755 transitions. [2025-03-09 00:29:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:29:25,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:25,874 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:25,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:29:25,874 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-09 00:29:25,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2013562256, now seen corresponding path program 1 times [2025-03-09 00:29:25,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:25,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943002083] [2025-03-09 00:29:25,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:25,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:26,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:29:26,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:29:26,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:26,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:27,140 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-09 00:29:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943002083] [2025-03-09 00:29:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943002083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:27,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:29:27,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020221034] [2025-03-09 00:29:27,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:27,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:29:27,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:27,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:29:27,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:29:27,141 INFO L87 Difference]: Start difference. First operand 1811 states and 2755 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 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-09 00:29:31,182 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-09 00:29:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:32,273 INFO L93 Difference]: Finished difference Result 1811 states and 2756 transitions. [2025-03-09 00:29:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:29:32,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 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-09 00:29:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:32,279 INFO L225 Difference]: With dead ends: 1811 [2025-03-09 00:29:32,280 INFO L226 Difference]: Without dead ends: 1811 [2025-03-09 00:29:32,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:29:32,280 INFO L435 NwaCegarLoop]: 1168 mSDtfsCounter, 994 mSDsluCounter, 3731 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 4899 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:32,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 4899 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 489 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-09 00:29:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-03-09 00:29:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1810. [2025-03-09 00:29:32,298 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-09 00:29:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2754 transitions. [2025-03-09 00:29:32,301 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2754 transitions. Word has length 44 [2025-03-09 00:29:32,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:32,301 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2754 transitions. [2025-03-09 00:29:32,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 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-09 00:29:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2754 transitions. [2025-03-09 00:29:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:29:32,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:32,302 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-09 00:29:32,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:29:32,302 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-09 00:29:32,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1776433978, now seen corresponding path program 1 times [2025-03-09 00:29:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699162441] [2025-03-09 00:29:32,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:32,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:29:32,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:29:32,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:32,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:33,277 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-09 00:29:33,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:33,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699162441] [2025-03-09 00:29:33,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699162441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:33,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:33,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:29:33,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969068846] [2025-03-09 00:29:33,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:33,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:29:33,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:33,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:29:33,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:33,278 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)