./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:42:23,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:42:24,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:42:24,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:42:24,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:42:24,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:42:24,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:42:24,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:42:24,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:42:24,084 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:42:24,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:42:24,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:42:24,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:42:24,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:42:24,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:42:24,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:42:24,086 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:24,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:42:24,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:42:24,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:42:24,087 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d [2025-02-08 07:42:24,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:42:24,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:42:24,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:42:24,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:42:24,290 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:42:24,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2025-02-08 07:42:25,395 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9657c4c2/9c2acda2779542a2bd4c9bd76078690e/FLAG0ce99ef22 [2025-02-08 07:42:25,796 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:42:25,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2025-02-08 07:42:25,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9657c4c2/9c2acda2779542a2bd4c9bd76078690e/FLAG0ce99ef22 [2025-02-08 07:42:25,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9657c4c2/9c2acda2779542a2bd4c9bd76078690e [2025-02-08 07:42:25,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:42:25,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:42:25,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:25,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:42:25,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:42:25,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:25" (1/1) ... [2025-02-08 07:42:25,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@187be3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:25, skipping insertion in model container [2025-02-08 07:42:25,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:25" (1/1) ... [2025-02-08 07:42:25,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:42:26,372 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,375 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,377 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,378 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,379 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,379 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,380 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,380 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,381 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,382 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,384 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,387 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,387 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,391 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,393 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,397 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,405 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:26,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:26,445 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:42:26,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:26,664 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 07:42:26,669 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:42:26,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26 WrapperNode [2025-02-08 07:42:26,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:26,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:26,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:42:26,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:42:26,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,744 INFO L138 Inliner]: procedures = 574, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 776 [2025-02-08 07:42:26,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:26,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:42:26,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:42:26,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:42:26,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,787 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 07:42:26,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:42:26,870 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:42:26,870 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:42:26,870 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:42:26,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (1/1) ... [2025-02-08 07:42:26,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:26,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:26,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:42:26,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:42:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:42:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 07:42:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 07:42:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 07:42:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:42:26,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:42:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 07:42:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:42:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:42:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 07:42:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 07:42:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 07:42:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 07:42:26,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:42:26,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:42:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:42:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 07:42:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 07:42:26,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 07:42:27,167 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:42:27,170 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:42:27,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1984: assume !(0 == ~logmode~0 % 2);assume { :begin_inline_fflush_all } true;havoc fflush_all_#res#1;havoc fflush_all_#t~nondet101#1, fflush_all_~return_value_fflush$1~0#1;havoc fflush_all_~return_value_fflush$1~0#1; [2025-02-08 07:42:27,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1984: assume !!(0 == ~logmode~0 % 2); [2025-02-08 07:42:27,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: assume true; [2025-02-08 07:42:27,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: assume !true;bb_verror_msg_#t~ret74#1 := vasprintf_#res#1;havoc vasprintf_#in~__ptr#1.base, vasprintf_#in~__ptr#1.offset, vasprintf_#in~__f#1.base, vasprintf_#in~__f#1.offset, vasprintf_#in~__arg#1.base, vasprintf_#in~__arg#1.offset;assume { :end_inline_vasprintf } true;assume -2147483648 <= bb_verror_msg_#t~ret74#1 && bb_verror_msg_#t~ret74#1 <= 2147483647;bb_verror_msg_~used~0#1 := bb_verror_msg_#t~ret74#1;havoc bb_verror_msg_#t~ret74#1; [2025-02-08 07:42:27,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382-1: assume false; [2025-02-08 07:42:27,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382-1: assume !false; [2025-02-08 07:42:27,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2034: assume __main_~return_value_mkfifo$1~0#1 < 0; [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2034: assume !(__main_~return_value_mkfifo$1~0#1 < 0); [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935: assume !(bb_verror_msg_~strerr#1.base == 0 && bb_verror_msg_~strerr#1.offset == 0); [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935: assume !!(bb_verror_msg_~strerr#1.base == 0 && bb_verror_msg_~strerr#1.offset == 0);bb_verror_msg_~tmp_if_expr$3~0#1 := 0; [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: assume safe_write_~n~0#1 < 0; [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1952: assume bb_verror_msg_~msg1~0#1.base == 0 && bb_verror_msg_~msg1~0#1.offset == 0;bb_verror_msg_~tmp_post$6~0#1 := bb_verror_msg_~used~0#1;bb_verror_msg_~used~0#1 := 1 + bb_verror_msg_~used~0#1; [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1952: assume !(bb_verror_msg_~msg1~0#1.base == 0 && bb_verror_msg_~msg1~0#1.offset == 0); [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1969: assume !(0 == bb_verror_msg_#t~mem88#1);havoc bb_verror_msg_#t~mem88#1;bb_verror_msg_~tmp_post$7~0#1 := bb_verror_msg_~used~0#1;bb_verror_msg_~used~0#1 := 1 + bb_verror_msg_~used~0#1; [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1969: assume !!(0 == bb_verror_msg_#t~mem88#1);havoc bb_verror_msg_#t~mem88#1; [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1969-1: SUMMARY for call bb_verror_msg_#t~mem88#1 := read~int(bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset, 1); srcloc: null [2025-02-08 07:42:27,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1969-1: assume !(1 == #valid[bb_verror_msg_~s#1.base]); [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1969-1: assume !(1 + bb_verror_msg_~s#1.offset <= #length[bb_verror_msg_~s#1.base] && 0 <= bb_verror_msg_~s#1.offset); [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2052: safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem111#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2052-1: SUMMARY for call safe_write_#t~mem111#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2052-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2052-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: bb_verror_msg_#t~ret95#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet101#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret95#1 && bb_verror_msg_#t~ret95#1 <= 2147483647;havoc bb_verror_msg_#t~ret95#1; [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2036: assume { :begin_inline_bb_simple_perror_msg } true;bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset := __main_#t~mem108#1.base, __main_#t~mem108#1.offset;havoc bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset, bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset;bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset := bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset;call bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset := #Ultimate.allocOnHeap(8); [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2003: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret110#1, safe_write_#t~mem111#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2003: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2036-1: SUMMARY for call __main_#t~mem108#1.base, __main_#t~mem108#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8); srcloc: null [2025-02-08 07:42:27,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2036-1: assume !(1 == #valid[__main_~argv#1.base]); [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2036-1: assume !(8 + __main_~argv#1.offset <= #length[__main_~argv#1.base] && 0 <= __main_~argv#1.offset); [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937: assume bb_verror_msg_~strerr#1.offset < #length[bb_verror_msg_~strerr#1.base] && bb_verror_msg_~strerr#1.offset >= 0;bb_verror_msg_~return_value_strlen$2~0#1 := bb_verror_msg_#t~nondet76#1;havoc bb_verror_msg_#t~nondet76#1;bb_verror_msg_~tmp_if_expr$3~0#1 := bb_verror_msg_~return_value_strlen$2~0#1; [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937: assume !(bb_verror_msg_~strerr#1.offset < #length[bb_verror_msg_~strerr#1.base] && bb_verror_msg_~strerr#1.offset >= 0); [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937-1: assume 1 == #valid[bb_verror_msg_~strerr#1.base]; [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937-1: assume !(1 == #valid[bb_verror_msg_~strerr#1.base]); [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904: assume { :begin_inline_bb_verror_msg } true;bb_verror_msg_#in~s#1.base, bb_verror_msg_#in~s#1.offset, bb_verror_msg_#in~p#1.base, bb_verror_msg_#in~p#1.offset, bb_verror_msg_#in~strerr#1.base, bb_verror_msg_#in~strerr#1.offset := bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset;havoc bb_verror_msg_#t~ret74#1, bb_verror_msg_#t~nondet75#1, bb_verror_msg_#t~nondet76#1, bb_verror_msg_#t~nondet77#1, bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset, bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset, bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset, bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset, bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset, bb_verror_msg_#t~memmove~res83#1.base, bb_verror_msg_#t~memmove~res83#1.offset, bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset, bb_verror_msg_#t~strcpy~res85#1.base, bb_verror_msg_#t~strcpy~res85#1.offset, bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset, bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset, bb_verror_msg_#t~mem88#1, bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset, bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset, bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset, bb_verror_msg_#t~strcpy~res92#1.base, bb_verror_msg_#t~strcpy~res92#1.offset, bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset, bb_verror_msg_#t~strcpy~res94#1.base, bb_verror_msg_#t~strcpy~res94#1.offset, bb_verror_msg_#t~ret95#1, bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset, bb_verror_msg_#t~ret97#1, bb_verror_msg_#t~bitwise98#1, bb_verror_msg_#t~mem99#1.base, bb_verror_msg_#t~mem99#1.offset, bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset, bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset, bb_verror_msg_~p#1.base, bb_verror_msg_~p#1.offset, bb_verror_msg_~strerr#1.base, bb_verror_msg_~strerr#1.offset, bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset, bb_verror_msg_~applet_len~0#1, bb_verror_msg_~strerr_len~0#1, bb_verror_msg_~msgeol_len~0#1, bb_verror_msg_~used~0#1, bb_verror_msg_~return_value_strlen$1~0#1, bb_verror_msg_~tmp_if_expr$3~0#1, bb_verror_msg_~return_value_strlen$2~0#1, bb_verror_msg_~return_value_strlen$4~0#1, bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset, bb_verror_msg_~tmp_post$6~0#1, bb_verror_msg_~tmp_post$7~0#1, bb_verror_msg_~tmp_post$8~0#1;bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset := bb_verror_msg_#in~s#1.base, bb_verror_msg_#in~s#1.offset;bb_verror_msg_~p#1.base, bb_verror_msg_~p#1.offset := bb_verror_msg_#in~p#1.base, bb_verror_msg_#in~p#1.offset;bb_verror_msg_~strerr#1.base, bb_verror_msg_~strerr#1.offset := bb_verror_msg_#in~strerr#1.base, bb_verror_msg_#in~strerr#1.offset;call bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset := #Ultimate.allocOnStack(8);havoc bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset;havoc bb_verror_msg_~applet_len~0#1;havoc bb_verror_msg_~strerr_len~0#1;havoc bb_verror_msg_~msgeol_len~0#1;havoc bb_verror_msg_~used~0#1; [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: bb_verror_msg_#t~ret97#1 := full_write_#res#1;havoc full_write_#t~ret102#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= bb_verror_msg_#t~ret97#1 && bb_verror_msg_#t~ret97#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset;havoc bb_verror_msg_#t~ret97#1; [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987-1: assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret102#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987-2: SUMMARY for call bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905: assume 0 == bb_perror_msg_~p~0#1.base || 1 == #valid[bb_perror_msg_~p~0#1.base];call ULTIMATE.dealloc(bb_perror_msg_~p~0#1.base, 0);havoc bb_perror_msg_#t~mem70#1, bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset, bb_perror_msg_#t~nondet72#1, bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset, bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;havoc bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset, bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset;assume { :end_inline_bb_perror_msg } true;havoc bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset;havoc bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset, bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset;havoc bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset;assume { :end_inline_bb_simple_perror_msg } true;havoc __main_#t~mem108#1.base, __main_#t~mem108#1.offset;__main_~retval~0#1 := 1; [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905: assume !(0 == bb_perror_msg_~p~0#1.base || 1 == #valid[bb_perror_msg_~p~0#1.base]); [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-1: assume bb_perror_msg_~p~0#1.base < #StackHeapBarrier; [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-1: assume !(bb_perror_msg_~p~0#1.base < #StackHeapBarrier); [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-2: assume true; [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-2: assume !true; [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2005: full_write_#t~ret102#1 := safe_write_#res#1;havoc safe_write_#t~ret110#1, safe_write_#t~mem111#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret102#1 && full_write_#t~ret102#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret102#1;havoc full_write_#t~ret102#1; [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: assume !(0 == bb_verror_msg_#t~bitwise98#1);havoc bb_verror_msg_#t~bitwise98#1; [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: assume !!(0 == bb_verror_msg_#t~bitwise98#1);havoc bb_verror_msg_#t~bitwise98#1; [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-1: [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956: havoc bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset;bb_verror_msg_~applet_len~0#1 := 0; [2025-02-08 07:42:27,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-2: havoc bb_verror_msg_#t~bitwise98#1;assume (((bb_verror_msg_#t~bitwise98#1 <= 2 && (~logmode~0 < 0 || bb_verror_msg_#t~bitwise98#1 <= ~logmode~0)) && bb_verror_msg_#t~bitwise98#1 >= 0) && (~logmode~0 >= 0 || bb_verror_msg_#t~bitwise98#1 > 2 + ~logmode~0)) && bb_verror_msg_#t~bitwise98#1 >= -2147483648; [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956-1: SUMMARY for call write~int(10, bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset + bb_verror_msg_~tmp_post$6~0#1, 1); srcloc: null [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956-1: assume !(1 == #valid[bb_verror_msg_#t~mem80#1.base]); [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956-1: assume !(1 + (bb_verror_msg_#t~mem80#1.offset + bb_verror_msg_~tmp_post$6~0#1) <= #length[bb_verror_msg_#t~mem80#1.base] && 0 <= bb_verror_msg_#t~mem80#1.offset + bb_verror_msg_~tmp_post$6~0#1); [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923: assume 0 == ~logmode~0;call ULTIMATE.dealloc(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset);havoc bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset; [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923: assume !(0 == ~logmode~0); [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-3: assume 2 == ~logmode~0;bb_verror_msg_#t~bitwise98#1 := 2; [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-3: assume !(2 == ~logmode~0); [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956-2: SUMMARY for call bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-4: assume 0 == ~logmode~0;bb_verror_msg_#t~bitwise98#1 := 0; [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-4: assume !(0 == ~logmode~0); [2025-02-08 07:42:27,800 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2039: __main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;havoc __main_~return_value_mkfifo$1~0#1; [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2006: assume full_write_~cc~0#1 < 0; [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2006: assume !(full_write_~cc~0#1 < 0);full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973: havoc bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset;bb_verror_msg_~tmp_post$8~0#1 := bb_verror_msg_~used~0#1;bb_verror_msg_~used~0#1 := 1 + bb_verror_msg_~used~0#1; [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973-1: SUMMARY for call write~int(58, bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset + bb_verror_msg_~tmp_post$7~0#1, 1); srcloc: null [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973-1: assume !(1 == #valid[bb_verror_msg_#t~mem89#1.base]); [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973-1: assume !(1 + (bb_verror_msg_#t~mem89#1.offset + bb_verror_msg_~tmp_post$7~0#1) <= #length[bb_verror_msg_#t~mem89#1.base] && 0 <= bb_verror_msg_#t~mem89#1.offset + bb_verror_msg_~tmp_post$7~0#1); [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973-2: SUMMARY for call bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1973-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1990: assume { :begin_inline_syslog } true;syslog_#in~priority#1, syslog_#in~format#1.base, syslog_#in~format#1.offset := 3, 6, 0;havoc syslog_~priority#1, syslog_~format#1.base, syslog_~format#1.offset;syslog_~priority#1 := syslog_#in~priority#1;syslog_~format#1.base, syslog_~format#1.offset := syslog_#in~format#1.base, syslog_#in~format#1.offset;havoc syslog_~priority#1, syslog_~format#1.base, syslog_~format#1.offset;havoc syslog_#in~priority#1, syslog_#in~format#1.base, syslog_#in~format#1.offset;assume { :end_inline_syslog } true; [2025-02-08 07:42:27,801 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1990-1: SUMMARY for call bb_verror_msg_#t~mem99#1.base, bb_verror_msg_#t~mem99#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1990-1: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1990-1: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2057-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991: assume 0 == bb_verror_msg_#t~mem100#1.base || 1 == #valid[bb_verror_msg_#t~mem100#1.base];call ULTIMATE.dealloc(bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset);havoc bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset;call ULTIMATE.dealloc(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset);havoc bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset;havoc bb_verror_msg_#t~ret74#1, bb_verror_msg_#t~nondet75#1, bb_verror_msg_#t~nondet76#1, bb_verror_msg_#t~nondet77#1, bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset, bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset, bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset, bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset, bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset, bb_verror_msg_#t~memmove~res83#1.base, bb_verror_msg_#t~memmove~res83#1.offset, bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset, bb_verror_msg_#t~strcpy~res85#1.base, bb_verror_msg_#t~strcpy~res85#1.offset, bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset, bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset, bb_verror_msg_#t~mem88#1, bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset, bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset, bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset, bb_verror_msg_#t~strcpy~res92#1.base, bb_verror_msg_#t~strcpy~res92#1.offset, bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset, bb_verror_msg_#t~strcpy~res94#1.base, bb_verror_msg_#t~strcpy~res94#1.offset, bb_verror_msg_#t~ret95#1, bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset, bb_verror_msg_#t~ret97#1, bb_verror_msg_#t~bitwise98#1, bb_verror_msg_#t~mem99#1.base, bb_verror_msg_#t~mem99#1.offset, bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset, bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset, bb_verror_msg_~p#1.base, bb_verror_msg_~p#1.offset, bb_verror_msg_~strerr#1.base, bb_verror_msg_~strerr#1.offset, bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset, bb_verror_msg_~applet_len~0#1, bb_verror_msg_~strerr_len~0#1, bb_verror_msg_~msgeol_len~0#1, bb_verror_msg_~used~0#1, bb_verror_msg_~return_value_strlen$1~0#1, bb_verror_msg_~tmp_if_expr$3~0#1, bb_verror_msg_~return_value_strlen$2~0#1, bb_verror_msg_~return_value_strlen$4~0#1, bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset, bb_verror_msg_~tmp_post$6~0#1, bb_verror_msg_~tmp_post$7~0#1, bb_verror_msg_~tmp_post$8~0#1;havoc bb_verror_msg_#in~s#1.base, bb_verror_msg_#in~s#1.offset, bb_verror_msg_#in~p#1.base, bb_verror_msg_#in~p#1.offset, bb_verror_msg_#in~strerr#1.base, bb_verror_msg_#in~strerr#1.offset;assume { :end_inline_bb_verror_msg } true; [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991: assume !(0 == bb_verror_msg_#t~mem100#1.base || 1 == #valid[bb_verror_msg_#t~mem100#1.base]); [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-1: assume bb_verror_msg_#t~mem100#1.base < #StackHeapBarrier; [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-1: assume !(bb_verror_msg_#t~mem100#1.base < #StackHeapBarrier); [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-2: assume 0 == bb_verror_msg_#t~mem100#1.offset; [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-2: assume !(0 == bb_verror_msg_#t~mem100#1.offset); [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925: assume bb_verror_msg_~s#1.base == 0 && bb_verror_msg_~s#1.offset == 0;bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset := 5, 0; [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925: assume !(bb_verror_msg_~s#1.base == 0 && bb_verror_msg_~s#1.offset == 0); [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-3: SUMMARY for call bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-3: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,802 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-3: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2041: SUMMARY for call __main_#t~mem109#1.base, __main_#t~mem109#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8); srcloc: null [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2041: assume !(1 == #valid[__main_~argv#1.base]); [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2041: assume !(8 + __main_~argv#1.offset <= #length[__main_~argv#1.base] && 0 <= __main_~argv#1.offset); [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2008: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2008: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1942: bb_verror_msg_~strerr_len~0#1 := (if bb_verror_msg_~tmp_if_expr$3~0#1 % 18446744073709551616 % 4294967296 <= 2147483647 then bb_verror_msg_~tmp_if_expr$3~0#1 % 18446744073709551616 % 4294967296 else bb_verror_msg_~tmp_if_expr$3~0#1 % 18446744073709551616 % 4294967296 - 4294967296);havoc bb_verror_msg_~return_value_strlen$4~0#1; [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976: havoc bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset; [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976-1: SUMMARY for call write~int(32, bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset + bb_verror_msg_~tmp_post$8~0#1, 1); srcloc: null [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976-1: assume !(1 == #valid[bb_verror_msg_#t~mem90#1.base]); [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976-1: assume !(1 + (bb_verror_msg_#t~mem90#1.offset + bb_verror_msg_~tmp_post$8~0#1) <= #length[bb_verror_msg_#t~mem90#1.base] && 0 <= bb_verror_msg_#t~mem90#1.offset + bb_verror_msg_~tmp_post$8~0#1); [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976-2: SUMMARY for call bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,803 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927: assume { :begin_inline_vasprintf } true;vasprintf_#in~__ptr#1.base, vasprintf_#in~__ptr#1.offset, vasprintf_#in~__f#1.base, vasprintf_#in~__f#1.offset, vasprintf_#in~__arg#1.base, vasprintf_#in~__arg#1.offset := bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset, bb_verror_msg_~p#1.base, bb_verror_msg_~p#1.offset;havoc vasprintf_#res#1; [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1944: assume ~msg_eol~0.offset < #length[~msg_eol~0.base] && ~msg_eol~0.offset >= 0;bb_verror_msg_~return_value_strlen$4~0#1 := bb_verror_msg_#t~nondet77#1;havoc bb_verror_msg_#t~nondet77#1;bb_verror_msg_~msgeol_len~0#1 := (if bb_verror_msg_~return_value_strlen$4~0#1 % 18446744073709551616 % 4294967296 <= 2147483647 then bb_verror_msg_~return_value_strlen$4~0#1 % 18446744073709551616 % 4294967296 else bb_verror_msg_~return_value_strlen$4~0#1 % 18446744073709551616 % 4294967296 - 4294967296);havoc bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset; [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1944: assume !(~msg_eol~0.offset < #length[~msg_eol~0.base] && ~msg_eol~0.offset >= 0); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1944-1: assume 1 == #valid[~msg_eol~0.base]; [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1944-1: assume !(1 == #valid[~msg_eol~0.base]); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1961: SUMMARY for call write~$Pointer$(bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset, bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1961: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1961: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: assume bb_verror_msg_~used~0#1 < 0;call ULTIMATE.dealloc(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset);havoc bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset; [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: assume !(bb_verror_msg_~used~0#1 < 0);havoc bb_verror_msg_~return_value_strlen$1~0#1; [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1978: havoc bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset;havoc bb_verror_msg_#t~strcpy~res92#1.base, bb_verror_msg_#t~strcpy~res92#1.offset;bb_verror_msg_~used~0#1 := (if (bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1) % 4294967296 % 4294967296 <= 2147483647 then (bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1) % 4294967296 % 4294967296 else (bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1) % 4294967296 % 4294967296 - 4294967296); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1978-1: SUMMARY for call bb_verror_msg_#t~strcpy~res92#1.base, bb_verror_msg_#t~strcpy~res92#1.offset := #Ultimate.C_strcpy(bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset + bb_verror_msg_~used~0#1, bb_verror_msg_~strerr#1.base, bb_verror_msg_~strerr#1.offset); srcloc: null [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1978-2: SUMMARY for call bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1978-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1978-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: write_#res#1 := write_~ret~1#1; [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962: assume { :begin_inline_#Ultimate.C_memmove } true;#Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset, #Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset, #Ultimate.C_memmove_size#1 := bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset + bb_verror_msg_~applet_len~0#1, bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset, bb_verror_msg_~used~0#1; [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-1: SUMMARY for call bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-1: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-1: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-2: SUMMARY for call bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1962-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1913: assume { :begin_inline_bb_perror_msg } true;bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset, bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset := 4, 0, bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset;havoc bb_perror_msg_#t~mem70#1, bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset, bb_perror_msg_#t~nondet72#1, bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset, bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset := bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset;havoc bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset;bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset := bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset;havoc bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset;havoc bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset; [2025-02-08 07:42:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1913-1: SUMMARY for call write~$Pointer$(bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset, bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset, 8); srcloc: null [2025-02-08 07:42:27,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1913-1: assume !(1 == #valid[bb_simple_perror_msg_#t~varargs73#1.base]); [2025-02-08 07:42:27,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1913-1: assume !(8 + bb_simple_perror_msg_#t~varargs73#1.offset <= #length[bb_simple_perror_msg_#t~varargs73#1.base] && 0 <= bb_simple_perror_msg_#t~varargs73#1.offset); [2025-02-08 07:42:27,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996: assume true; [2025-02-08 07:42:27,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996: assume !true;fflush_all_~return_value_fflush$1~0#1 := fflush_all_#t~nondet101#1;havoc fflush_all_#t~nondet101#1;fflush_all_#res#1 := fflush_all_~return_value_fflush$1~0#1; [2025-02-08 07:42:27,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996-1: assume false; [2025-02-08 07:42:27,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996-1: assume !false; [2025-02-08 07:42:27,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897: assume !(0 == bb_perror_msg_#t~mem70#1);havoc bb_perror_msg_#t~mem70#1; [2025-02-08 07:42:27,805 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897: assume !!(0 == bb_perror_msg_#t~mem70#1);havoc bb_perror_msg_#t~mem70#1;bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset := 0, 0; [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897-1: SUMMARY for call bb_perror_msg_#t~mem70#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947: assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset, (3 + (bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1)) % 4294967296;havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-1: SUMMARY for call bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-1: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-1: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030-1: assume !(__main_#t~mem109#1.base == 0 && __main_#t~mem109#1.offset == 0);havoc __main_#t~mem109#1.base, __main_#t~mem109#1.offset; [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030-1: assume !!(__main_#t~mem109#1.base == 0 && __main_#t~mem109#1.offset == 0);havoc __main_#t~mem109#1.base, __main_#t~mem109#1.offset; [2025-02-08 07:42:27,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964: havoc bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset;havoc bb_verror_msg_#t~strcpy~res85#1.base, bb_verror_msg_#t~strcpy~res85#1.offset; [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-1: SUMMARY for call bb_verror_msg_#t~strcpy~res85#1.base, bb_verror_msg_#t~strcpy~res85#1.offset := #Ultimate.C_strcpy(bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset, ~applet_name~0.base, ~applet_name~0.offset); srcloc: null [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1931: assume ~applet_name~0.offset < #length[~applet_name~0.base] && ~applet_name~0.offset >= 0;bb_verror_msg_~return_value_strlen$1~0#1 := bb_verror_msg_#t~nondet75#1;havoc bb_verror_msg_#t~nondet75#1;bb_verror_msg_~applet_len~0#1 := (if (2 + bb_verror_msg_~return_value_strlen$1~0#1) % 18446744073709551616 % 4294967296 <= 2147483647 then (2 + bb_verror_msg_~return_value_strlen$1~0#1) % 18446744073709551616 % 4294967296 else (2 + bb_verror_msg_~return_value_strlen$1~0#1) % 18446744073709551616 % 4294967296 - 4294967296);havoc bb_verror_msg_~tmp_if_expr$3~0#1;havoc bb_verror_msg_~return_value_strlen$2~0#1; [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1931: assume !(~applet_name~0.offset < #length[~applet_name~0.base] && ~applet_name~0.offset >= 0); [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-2: SUMMARY for call bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1931-1: assume 1 == #valid[~applet_name~0.base]; [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1931-1: assume !(1 == #valid[~applet_name~0.base]); [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume #Ultimate.C_memmove_#t~loopctr170#1 % 18446744073709551616 < #Ultimate.C_memmove_size#1 % 18446744073709551616;call #Ultimate.C_memmove_#t~mem171#1.base, #Ultimate.C_memmove_#t~mem171#1.offset := read~unchecked~$Pointer$(#Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset + #Ultimate.C_memmove_#t~loopctr170#1, 8);call write~unchecked~$Pointer$(#Ultimate.C_memmove_#t~mem171#1.base, #Ultimate.C_memmove_#t~mem171#1.offset, #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset + #Ultimate.C_memmove_#t~loopctr170#1, 8);#Ultimate.C_memmove_#t~loopctr170#1 := 8 + #Ultimate.C_memmove_#t~loopctr170#1; [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume !(#Ultimate.C_memmove_#t~loopctr170#1 % 18446744073709551616 < #Ultimate.C_memmove_size#1 % 18446744073709551616);assume #Ultimate.C_memmove_#res#1.base == #Ultimate.C_memmove_dest#1.base && #Ultimate.C_memmove_#res#1.offset == #Ultimate.C_memmove_dest#1.offset;bb_verror_msg_#t~memmove~res83#1.base, bb_verror_msg_#t~memmove~res83#1.offset := #Ultimate.C_memmove_#res#1.base, #Ultimate.C_memmove_#res#1.offset;havoc #Ultimate.C_memmove_#t~loopctr166#1, #Ultimate.C_memmove_#t~mem167#1, #Ultimate.C_memmove_#t~mem168#1, #Ultimate.C_memmove_#t~mem169#1, #Ultimate.C_memmove_#t~loopctr170#1, #Ultimate.C_memmove_#t~mem171#1.base, #Ultimate.C_memmove_#t~mem171#1.offset;havoc #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset, #Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset, #Ultimate.C_memmove_size#1;assume { :end_inline_#Ultimate.C_memmove } true;havoc bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset;havoc bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset;havoc bb_verror_msg_#t~memmove~res83#1.base, bb_verror_msg_#t~memmove~res83#1.offset;bb_verror_msg_~used~0#1 := bb_verror_msg_~used~0#1 + bb_verror_msg_~applet_len~0#1; [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume #Ultimate.C_memmove_#t~loopctr166#1 % 18446744073709551616 < #Ultimate.C_memmove_size#1 % 18446744073709551616;call #Ultimate.C_memmove_#t~mem167#1 := read~unchecked~int(#Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 2);call write~unchecked~int(#Ultimate.C_memmove_#t~mem167#1, #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 2);call #Ultimate.C_memmove_#t~mem168#1 := read~unchecked~int(#Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 1);call write~unchecked~int(#Ultimate.C_memmove_#t~mem168#1, #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 1);call #Ultimate.C_memmove_#t~mem169#1 := read~unchecked~int(#Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 4);call write~unchecked~int(#Ultimate.C_memmove_#t~mem169#1, #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 4);#Ultimate.C_memmove_#t~loopctr166#1 := 1 + #Ultimate.C_memmove_#t~loopctr166#1; [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume !(#Ultimate.C_memmove_#t~loopctr166#1 % 18446744073709551616 < #Ultimate.C_memmove_size#1 % 18446744073709551616);#Ultimate.C_memmove_#t~loopctr170#1 := 0; [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981: havoc bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset;havoc bb_verror_msg_#t~strcpy~res94#1.base, bb_verror_msg_#t~strcpy~res94#1.offset;bb_verror_msg_~used~0#1 := bb_verror_msg_~used~0#1 + bb_verror_msg_~msgeol_len~0#1; [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-2: assume #Ultimate.C_memmove_size#1 + #Ultimate.C_memmove_src#1.offset <= #length[#Ultimate.C_memmove_src#1.base] && 0 <= #Ultimate.C_memmove_src#1.offset;assume 1 == #valid[#Ultimate.C_memmove_dest#1.base];assume 1 == #valid[#Ultimate.C_memmove_src#1.base];assume #Ultimate.C_memmove_size#1 + #Ultimate.C_memmove_dest#1.offset <= #length[#Ultimate.C_memmove_dest#1.base] && 0 <= #Ultimate.C_memmove_dest#1.offset;assume #Ultimate.C_memmove_size#1 + #Ultimate.C_memmove_src#1.offset <= #length[#Ultimate.C_memmove_src#1.base] && 0 <= #Ultimate.C_memmove_src#1.offset;havoc #Ultimate.C_memmove_#res#1.base, #Ultimate.C_memmove_#res#1.offset;havoc #Ultimate.C_memmove_#t~loopctr166#1, #Ultimate.C_memmove_#t~mem167#1, #Ultimate.C_memmove_#t~mem168#1, #Ultimate.C_memmove_#t~mem169#1, #Ultimate.C_memmove_#t~loopctr170#1, #Ultimate.C_memmove_#t~mem171#1.base, #Ultimate.C_memmove_#t~mem171#1.offset;#Ultimate.C_memmove_#t~loopctr166#1 := 0; [2025-02-08 07:42:27,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-2: assume !(#Ultimate.C_memmove_size#1 + #Ultimate.C_memmove_src#1.offset <= #length[#Ultimate.C_memmove_src#1.base] && 0 <= #Ultimate.C_memmove_src#1.offset); [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981-1: SUMMARY for call bb_verror_msg_#t~strcpy~res94#1.base, bb_verror_msg_#t~strcpy~res94#1.offset := #Ultimate.C_strcpy(bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset + bb_verror_msg_~used~0#1, ~msg_eol~0.base, ~msg_eol~0.offset); srcloc: null [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-3: assume #Ultimate.C_memmove_size#1 + #Ultimate.C_memmove_dest#1.offset <= #length[#Ultimate.C_memmove_dest#1.base] && 0 <= #Ultimate.C_memmove_dest#1.offset; [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-3: assume !(#Ultimate.C_memmove_size#1 + #Ultimate.C_memmove_dest#1.offset <= #length[#Ultimate.C_memmove_dest#1.base] && 0 <= #Ultimate.C_memmove_dest#1.offset); [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981-2: SUMMARY for call bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-4: assume 1 == #valid[#Ultimate.C_memmove_src#1.base]; [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-4: assume !(1 == #valid[#Ultimate.C_memmove_src#1.base]); [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-5: assume 1 == #valid[#Ultimate.C_memmove_dest#1.base]; [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-5: assume !(1 == #valid[#Ultimate.C_memmove_dest#1.base]); [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-8: assume #Ultimate.C_realloc_ptr#1.base == 0 && #Ultimate.C_realloc_ptr#1.offset == 0;call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1 % 18446744073709551616); [2025-02-08 07:42:27,808 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-8: assume !(#Ultimate.C_realloc_ptr#1.base == 0 && #Ultimate.C_realloc_ptr#1.offset == 0);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1 % 18446744073709551616);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~storeAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_ptr#1.base), ~selectAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_ptr#1.base)), ~storeAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_ptr#1.base), ~selectAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_ptr#1.base));#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base));bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;havoc #Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1;assume { :end_inline_#Ultimate.C_realloc } true;bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset := bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset;havoc bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset;havoc bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset;bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset := bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset;havoc bb_verror_msg_~tmp_post$6~0#1;havoc bb_verror_msg_~tmp_post$7~0#1;havoc bb_verror_msg_~tmp_post$8~0#1; [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: havoc bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset; [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-1: SUMMARY for call write~int(58, bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset + (bb_verror_msg_~applet_len~0#1 - 2), 1); srcloc: null [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-1: assume !(1 == #valid[bb_verror_msg_#t~mem86#1.base]); [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-1: assume !(1 + (bb_verror_msg_#t~mem86#1.offset + (bb_verror_msg_~applet_len~0#1 - 2)) <= #length[bb_verror_msg_#t~mem86#1.base] && 0 <= bb_verror_msg_#t~mem86#1.offset + (bb_verror_msg_~applet_len~0#1 - 2)); [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-2: SUMMARY for call bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899: bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset := bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset;havoc bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset;havoc bb_perror_msg_#t~nondet72#1;bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset := bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset; [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-1: SUMMARY for call write~int(0, bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet72#1 % 18446744073709551616 - 1, 1); srcloc: null [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-1: assume !(1 == #valid[bb_perror_msg_#t~nondet71#1.base]); [2025-02-08 07:42:27,809 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-1: assume !(1 + (bb_perror_msg_#t~nondet72#1 % 18446744073709551616 - 1) <= #length[bb_perror_msg_#t~nondet71#1.base] && 0 <= bb_perror_msg_#t~nondet72#1 % 18446744073709551616 - 1); [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-2: assume true;bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset := 0, 0; [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-2: assume true;havoc bb_perror_msg_#t~nondet72#1;assume bb_perror_msg_#t~nondet72#1 % 18446744073709551616 > 0;call bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset := #Ultimate.allocOnHeap(bb_perror_msg_#t~nondet72#1 % 18446744073709551616); [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet147#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet147#1;assume -9223372036854775808 <= write_#t~nondet147#1 && write_#t~nondet147#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet147#1;havoc write_#t~nondet147#1; [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048: assume !true; [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966: havoc bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset; [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966-1: SUMMARY for call write~int(32, bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset + (bb_verror_msg_~applet_len~0#1 - 1), 1); srcloc: null [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966-1: assume !(1 == #valid[bb_verror_msg_#t~mem87#1.base]); [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966-1: assume !(1 + (bb_verror_msg_#t~mem87#1.offset + (bb_verror_msg_~applet_len~0#1 - 1)) <= #length[bb_verror_msg_#t~mem87#1.base] && 0 <= bb_verror_msg_#t~mem87#1.offset + (bb_verror_msg_~applet_len~0#1 - 1)); [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966-2: SUMMARY for call bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966-2: assume !(1 == #valid[bb_verror_msg_~#msg~0#1.base]); [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966-2: assume !(8 + bb_verror_msg_~#msg~0#1.offset <= #length[bb_verror_msg_~#msg~0#1.base] && 0 <= bb_verror_msg_~#msg~0#1.offset); [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2033: __main_#t~ret107#1 := mkfifo_#res#1;havoc mkfifo_#t~mem112#1, mkfifo_#t~nondet113#1, mkfifo_#t~nondet114#1, mkfifo_#t~mem115#1, mkfifo_~file#1.base, mkfifo_~file#1.offset, mkfifo_~mode#1;havoc mkfifo_#in~file#1.base, mkfifo_#in~file#1.offset, mkfifo_#in~mode#1;assume { :end_inline_mkfifo } true;assume -2147483648 <= __main_#t~ret107#1 && __main_#t~ret107#1 <= 2147483647;__main_~return_value_mkfifo$1~0#1 := __main_#t~ret107#1;havoc __main_#t~mem106#1.base, __main_#t~mem106#1.offset;havoc __main_#t~ret107#1; [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1967: assume !(bb_verror_msg_~strerr#1.base == 0 && bb_verror_msg_~strerr#1.offset == 0); [2025-02-08 07:42:27,810 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1967: assume !!(bb_verror_msg_~strerr#1.base == 0 && bb_verror_msg_~strerr#1.offset == 0); [2025-02-08 07:42:27,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2050: safe_write_#t~ret110#1 := write_#res#1;havoc write_#t~nondet147#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret110#1 && safe_write_#t~ret110#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret110#1;havoc safe_write_#t~ret110#1; [2025-02-08 07:42:27,824 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-02-08 07:42:27,824 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:42:27,832 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:42:27,833 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:42:27,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:42:27 BoogieIcfgContainer [2025-02-08 07:42:27,834 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:42:27,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:42:27,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:42:27,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:42:27,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:42:25" (1/3) ... [2025-02-08 07:42:27,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d82e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:42:27, skipping insertion in model container [2025-02-08 07:42:27,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:26" (2/3) ... [2025-02-08 07:42:27,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d82e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:42:27, skipping insertion in model container [2025-02-08 07:42:27,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:42:27" (3/3) ... [2025-02-08 07:42:27,842 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-1.i [2025-02-08 07:42:27,853 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:42:27,854 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-1.i that has 3 procedures, 129 locations, 1 initial locations, 12 loop locations, and 125 error locations. [2025-02-08 07:42:27,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:42:27,900 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;@d351e4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:42:27,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-02-08 07:42:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 107 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:42:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:42:27,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:27,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:42:27,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:27,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 12415, now seen corresponding path program 1 times [2025-02-08 07:42:27,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467042759] [2025-02-08 07:42:27,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:27,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:28,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:42:28,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:42:28,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:28,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:28,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:28,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467042759] [2025-02-08 07:42:28,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467042759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:28,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:28,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:42:28,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989120558] [2025-02-08 07:42:28,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:28,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:28,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:28,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:28,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:28,418 INFO L87 Difference]: Start difference. First operand has 112 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 107 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:28,488 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2025-02-08 07:42:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:42:28,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:42:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:28,494 INFO L225 Difference]: With dead ends: 77 [2025-02-08 07:42:28,494 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 07:42:28,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:28,497 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 68 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:28,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 50 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 07:42:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-08 07:42:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 40 states have (on average 1.8) internal successors, (72), 69 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2025-02-08 07:42:28,520 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 2 [2025-02-08 07:42:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:28,520 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2025-02-08 07:42:28,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2025-02-08 07:42:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:42:28,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:28,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:42:28,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:42:28,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:28,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash 12416, now seen corresponding path program 1 times [2025-02-08 07:42:28,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:28,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510820747] [2025-02-08 07:42:28,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:28,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:28,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:42:28,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:42:28,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:28,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:28,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510820747] [2025-02-08 07:42:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510820747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:28,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:28,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:42:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323272222] [2025-02-08 07:42:28,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:28,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:28,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:28,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:28,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:28,743 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:28,793 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2025-02-08 07:42:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:42:28,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:42:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:28,794 INFO L225 Difference]: With dead ends: 72 [2025-02-08 07:42:28,794 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 07:42:28,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:28,795 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 10 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:28,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 102 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:42:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 07:42:28,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-08 07:42:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.775) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2025-02-08 07:42:28,799 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 2 [2025-02-08 07:42:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:28,799 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2025-02-08 07:42:28,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2025-02-08 07:42:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:42:28,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:28,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:42:28,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:42:28,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:28,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:28,800 INFO L85 PathProgramCache]: Analyzing trace with hash 370176963, now seen corresponding path program 1 times [2025-02-08 07:42:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:28,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764351345] [2025-02-08 07:42:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:28,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:28,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:42:28,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:42:28,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:28,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:28,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764351345] [2025-02-08 07:42:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764351345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:28,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:28,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:42:28,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661482157] [2025-02-08 07:42:28,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:28,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:42:28,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:28,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:42:28,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:42:28,978 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:29,079 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2025-02-08 07:42:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:42:29,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:42:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:29,081 INFO L225 Difference]: With dead ends: 75 [2025-02-08 07:42:29,081 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 07:42:29,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:42:29,081 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:29,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 102 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 07:42:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-02-08 07:42:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 70 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2025-02-08 07:42:29,088 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 5 [2025-02-08 07:42:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:29,089 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2025-02-08 07:42:29,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2025-02-08 07:42:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:42:29,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:29,089 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:29,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:42:29,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:29,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:29,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1533824293, now seen corresponding path program 1 times [2025-02-08 07:42:29,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:29,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032326900] [2025-02-08 07:42:29,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:29,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:29,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:42:29,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:42:29,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:29,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:29,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032326900] [2025-02-08 07:42:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032326900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:29,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340440701] [2025-02-08 07:42:29,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:29,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:29,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:29,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:29,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:42:29,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:42:29,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:42:29,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:29,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:29,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:42:29,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:29,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:29,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 07:42:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340440701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:29,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:42:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:42:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257763747] [2025-02-08 07:42:29,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:29,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:42:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:29,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:42:29,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:42:29,686 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:29,833 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2025-02-08 07:42:29,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:42:29,834 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:42:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:29,834 INFO L225 Difference]: With dead ends: 78 [2025-02-08 07:42:29,835 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 07:42:29,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:42:29,835 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 83 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:29,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 181 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 07:42:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2025-02-08 07:42:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 71 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2025-02-08 07:42:29,839 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 8 [2025-02-08 07:42:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2025-02-08 07:42:29,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2025-02-08 07:42:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 07:42:29,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:29,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 07:42:29,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 07:42:30,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:30,045 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2163678, now seen corresponding path program 1 times [2025-02-08 07:42:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:30,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891969556] [2025-02-08 07:42:30,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:30,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 07:42:30,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 07:42:30,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:30,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:30,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:30,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891969556] [2025-02-08 07:42:30,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891969556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:30,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761153647] [2025-02-08 07:42:30,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:30,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:30,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:30,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:30,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:42:30,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 07:42:30,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 07:42:30,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:30,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:30,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 07:42:30,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:30,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761153647] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:30,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:42:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 07:42:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551842183] [2025-02-08 07:42:30,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 07:42:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:30,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 07:42:30,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:42:30,464 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:30,509 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2025-02-08 07:42:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:42:30,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 07:42:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:30,513 INFO L225 Difference]: With dead ends: 87 [2025-02-08 07:42:30,514 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 07:42:30,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:42:30,515 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 275 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:30,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 275 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:42:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 07:42:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 07:42:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 83 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:30,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-02-08 07:42:30,521 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 11 [2025-02-08 07:42:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:30,521 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-02-08 07:42:30,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-02-08 07:42:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 07:42:30,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:30,522 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2025-02-08 07:42:30,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:42:30,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:30,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:30,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:30,724 INFO L85 PathProgramCache]: Analyzing trace with hash -802435550, now seen corresponding path program 2 times [2025-02-08 07:42:30,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:30,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451314852] [2025-02-08 07:42:30,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:42:30,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:30,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 07:42:30,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-02-08 07:42:30,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:42:30,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-08 07:42:30,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:30,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451314852] [2025-02-08 07:42:30,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451314852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:30,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:30,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:42:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281277320] [2025-02-08 07:42:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:30,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:42:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:30,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:42:30,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:42:30,966 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:31,043 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2025-02-08 07:42:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:42:31,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 07:42:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:31,044 INFO L225 Difference]: With dead ends: 86 [2025-02-08 07:42:31,044 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 07:42:31,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:42:31,045 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 61 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:31,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 45 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 07:42:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-08 07:42:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 82 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-02-08 07:42:31,048 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 23 [2025-02-08 07:42:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:31,048 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-02-08 07:42:31,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-02-08 07:42:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 07:42:31,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:31,049 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2025-02-08 07:42:31,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:42:31,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:31,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash -802435549, now seen corresponding path program 1 times [2025-02-08 07:42:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908598437] [2025-02-08 07:42:31,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:31,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 07:42:31,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 07:42:31,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:31,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:31,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908598437] [2025-02-08 07:42:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908598437] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:31,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477750027] [2025-02-08 07:42:31,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:31,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:31,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:31,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:31,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:42:31,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 07:42:31,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 07:42:31,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:31,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:31,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 07:42:31,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:31,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477750027] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:31,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:42:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-02-08 07:42:31,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096030909] [2025-02-08 07:42:31,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:31,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:42:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:31,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:42:31,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:42:31,583 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:31,635 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2025-02-08 07:42:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:42:31,635 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 07:42:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:31,635 INFO L225 Difference]: With dead ends: 98 [2025-02-08 07:42:31,636 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 07:42:31,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:42:31,636 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 2 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:31,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:42:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 07:42:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 07:42:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 94 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2025-02-08 07:42:31,640 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 23 [2025-02-08 07:42:31,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:31,640 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2025-02-08 07:42:31,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2025-02-08 07:42:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:42:31,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:31,641 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-02-08 07:42:31,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 07:42:31,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:31,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:31,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash 164470819, now seen corresponding path program 2 times [2025-02-08 07:42:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929262846] [2025-02-08 07:42:31,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:42:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:31,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 07:42:31,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-02-08 07:42:31,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:42:31,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:32,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:32,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929262846] [2025-02-08 07:42:32,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929262846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:32,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:32,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:42:32,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936888119] [2025-02-08 07:42:32,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:32,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:42:32,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:32,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:42:32,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:32,022 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:32,081 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2025-02-08 07:42:32,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:42:32,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 07:42:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:32,082 INFO L225 Difference]: With dead ends: 101 [2025-02-08 07:42:32,082 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 07:42:32,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:32,083 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:32,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 134 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 07:42:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 07:42:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 96 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2025-02-08 07:42:32,087 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 35 [2025-02-08 07:42:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:32,087 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2025-02-08 07:42:32,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2025-02-08 07:42:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:42:32,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:32,088 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:32,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 07:42:32,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:32,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1603328516, now seen corresponding path program 1 times [2025-02-08 07:42:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346420544] [2025-02-08 07:42:32,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:32,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:32,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:42:32,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:42:32,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:32,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:32,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:32,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346420544] [2025-02-08 07:42:32,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346420544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:32,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:32,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:42:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501316045] [2025-02-08 07:42:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:32,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:32,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:32,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:32,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:32,290 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 07:42:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:32,336 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2025-02-08 07:42:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:42:32,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 43 [2025-02-08 07:42:32,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:32,337 INFO L225 Difference]: With dead ends: 96 [2025-02-08 07:42:32,337 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 07:42:32,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:32,338 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:32,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 50 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:42:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 07:42:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 07:42:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.323943661971831) internal successors, (94), 91 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2025-02-08 07:42:32,341 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 43 [2025-02-08 07:42:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:32,341 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2025-02-08 07:42:32,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 07:42:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2025-02-08 07:42:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:42:32,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:32,342 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:32,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:42:32,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:32,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:32,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1603328515, now seen corresponding path program 1 times [2025-02-08 07:42:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729224667] [2025-02-08 07:42:32,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:32,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:42:32,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:42:32,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:32,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729224667] [2025-02-08 07:42:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729224667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:32,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:32,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:42:32,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432295438] [2025-02-08 07:42:32,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:32,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:42:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:32,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:42:32,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:42:32,823 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-02-08 07:42:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:32,913 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2025-02-08 07:42:32,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:42:32,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 43 [2025-02-08 07:42:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:32,914 INFO L225 Difference]: With dead ends: 119 [2025-02-08 07:42:32,914 INFO L226 Difference]: Without dead ends: 119 [2025-02-08 07:42:32,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:42:32,915 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:32,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 176 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-08 07:42:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 95. [2025-02-08 07:42:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 90 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2025-02-08 07:42:32,919 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 43 [2025-02-08 07:42:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:32,919 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2025-02-08 07:42:32,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-02-08 07:42:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2025-02-08 07:42:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:42:32,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:32,920 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:32,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:42:32,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:32,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash -428215530, now seen corresponding path program 1 times [2025-02-08 07:42:32,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:32,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282455940] [2025-02-08 07:42:32,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:32,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:42:32,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:42:32,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:32,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:33,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:33,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282455940] [2025-02-08 07:42:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282455940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:33,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:33,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:42:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029566446] [2025-02-08 07:42:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:33,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:42:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:33,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:42:33,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:42:33,287 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-08 07:42:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:33,394 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2025-02-08 07:42:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:42:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2025-02-08 07:42:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:33,395 INFO L225 Difference]: With dead ends: 114 [2025-02-08 07:42:33,395 INFO L226 Difference]: Without dead ends: 114 [2025-02-08 07:42:33,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:42:33,396 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 163 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:33,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 71 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-08 07:42:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2025-02-08 07:42:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 104 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2025-02-08 07:42:33,399 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 46 [2025-02-08 07:42:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:33,400 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2025-02-08 07:42:33,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-08 07:42:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2025-02-08 07:42:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:42:33,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:33,401 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, 1, 1] [2025-02-08 07:42:33,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:42:33,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:33,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash -915714121, now seen corresponding path program 1 times [2025-02-08 07:42:33,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:33,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244549196] [2025-02-08 07:42:33,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:33,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:33,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:42:33,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:42:33,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:33,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:33,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244549196] [2025-02-08 07:42:33,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244549196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:33,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:33,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:42:33,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487071734] [2025-02-08 07:42:33,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:33,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:33,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:33,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:33,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:33,618 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-08 07:42:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:33,655 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2025-02-08 07:42:33,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:42:33,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-02-08 07:42:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:33,656 INFO L225 Difference]: With dead ends: 108 [2025-02-08 07:42:33,656 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 07:42:33,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-02-08 07:42:33,656 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 41 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:33,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 54 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:42:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 07:42:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-08 07:42:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 103 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2025-02-08 07:42:33,659 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 49 [2025-02-08 07:42:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:33,659 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2025-02-08 07:42:33,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-08 07:42:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2025-02-08 07:42:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:42:33,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:33,660 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, 1, 1] [2025-02-08 07:42:33,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:42:33,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:33,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash -915714120, now seen corresponding path program 1 times [2025-02-08 07:42:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:33,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043544389] [2025-02-08 07:42:33,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:33,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:33,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:42:33,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:42:33,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:33,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043544389] [2025-02-08 07:42:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043544389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:34,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:42:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647457935] [2025-02-08 07:42:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:34,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:42:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:34,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:42:34,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:42:34,101 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-02-08 07:42:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:34,228 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2025-02-08 07:42:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:42:34,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 49 [2025-02-08 07:42:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:34,228 INFO L225 Difference]: With dead ends: 112 [2025-02-08 07:42:34,229 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 07:42:34,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:42:34,229 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 143 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:34,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 78 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 07:42:34,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-02-08 07:42:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 103 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2025-02-08 07:42:34,235 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 49 [2025-02-08 07:42:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:34,235 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2025-02-08 07:42:34,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-02-08 07:42:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2025-02-08 07:42:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:42:34,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:34,238 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:34,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:42:34,238 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:34,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:34,238 INFO L85 PathProgramCache]: Analyzing trace with hash 471816370, now seen corresponding path program 1 times [2025-02-08 07:42:34,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:34,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209325640] [2025-02-08 07:42:34,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:34,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:42:34,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:42:34,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:34,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-08 07:42:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:34,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209325640] [2025-02-08 07:42:34,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209325640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:34,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:34,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:42:34,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132152177] [2025-02-08 07:42:34,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:34,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:42:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:34,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:42:34,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:34,401 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:34,461 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2025-02-08 07:42:34,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:42:34,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-02-08 07:42:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:34,462 INFO L225 Difference]: With dead ends: 106 [2025-02-08 07:42:34,462 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 07:42:34,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:42:34,462 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:34,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 75 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 07:42:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-08 07:42:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 101 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2025-02-08 07:42:34,465 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 52 [2025-02-08 07:42:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:34,465 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2025-02-08 07:42:34,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2025-02-08 07:42:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:42:34,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:34,466 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:34,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:42:34,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:34,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash 471816371, now seen corresponding path program 1 times [2025-02-08 07:42:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:34,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054382970] [2025-02-08 07:42:34,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:34,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:42:34,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:42:34,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:34,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 07:42:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:34,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054382970] [2025-02-08 07:42:34,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054382970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:34,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937946247] [2025-02-08 07:42:34,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:34,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:34,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:34,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:34,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:42:34,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:42:34,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:42:34,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:34,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:34,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 07:42:34,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 07:42:34,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:42:34,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937946247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:34,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 07:42:34,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-08 07:42:34,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370960495] [2025-02-08 07:42:34,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:34,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:42:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:34,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:42:34,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:42:34,965 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:35,037 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2025-02-08 07:42:35,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:42:35,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-02-08 07:42:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:35,039 INFO L225 Difference]: With dead ends: 111 [2025-02-08 07:42:35,039 INFO L226 Difference]: Without dead ends: 110 [2025-02-08 07:42:35,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:42:35,040 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:35,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 246 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-08 07:42:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2025-02-08 07:42:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 101 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2025-02-08 07:42:35,043 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 52 [2025-02-08 07:42:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:35,043 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2025-02-08 07:42:35,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2025-02-08 07:42:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:42:35,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:35,044 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, 1, 1, 1, 1, 1] [2025-02-08 07:42:35,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 07:42:35,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 07:42:35,245 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:35,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1593179310, now seen corresponding path program 1 times [2025-02-08 07:42:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:35,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117133202] [2025-02-08 07:42:35,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:35,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:42:35,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:42:35,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:35,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:35,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117133202] [2025-02-08 07:42:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117133202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:35,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:35,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:42:35,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493512347] [2025-02-08 07:42:35,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:35,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:42:35,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:35,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:42:35,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:42:35,648 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-08 07:42:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:35,738 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2025-02-08 07:42:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:42:35,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 52 [2025-02-08 07:42:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:35,739 INFO L225 Difference]: With dead ends: 105 [2025-02-08 07:42:35,739 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 07:42:35,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:42:35,739 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:35,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 153 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 07:42:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-08 07:42:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 100 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2025-02-08 07:42:35,742 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 52 [2025-02-08 07:42:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:35,742 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2025-02-08 07:42:35,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-08 07:42:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2025-02-08 07:42:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:42:35,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:35,743 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, 1, 1, 1, 1, 1] [2025-02-08 07:42:35,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:42:35,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:35,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1593179311, now seen corresponding path program 1 times [2025-02-08 07:42:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755706024] [2025-02-08 07:42:35,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:35,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:42:35,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:42:35,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:35,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755706024] [2025-02-08 07:42:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755706024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:42:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575032769] [2025-02-08 07:42:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:36,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:42:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:36,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:42:36,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:42:36,221 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-08 07:42:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:36,311 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2025-02-08 07:42:36,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:42:36,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 52 [2025-02-08 07:42:36,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:36,312 INFO L225 Difference]: With dead ends: 104 [2025-02-08 07:42:36,312 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 07:42:36,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:42:36,313 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:36,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 136 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 07:42:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-08 07:42:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 99 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2025-02-08 07:42:36,316 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 52 [2025-02-08 07:42:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:36,316 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2025-02-08 07:42:36,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-08 07:42:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2025-02-08 07:42:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 07:42:36,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:36,319 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:36,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:42:36,319 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:36,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash -978087262, now seen corresponding path program 1 times [2025-02-08 07:42:36,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:36,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323807878] [2025-02-08 07:42:36,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:36,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:36,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 07:42:36,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 07:42:36,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:36,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:36,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:36,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323807878] [2025-02-08 07:42:36,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323807878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:36,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:36,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:42:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725045017] [2025-02-08 07:42:36,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:36,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:36,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:36,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:36,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:36,436 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-02-08 07:42:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:36,474 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2025-02-08 07:42:36,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:42:36,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 56 [2025-02-08 07:42:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:36,479 INFO L225 Difference]: With dead ends: 116 [2025-02-08 07:42:36,479 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 07:42:36,479 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-02-08 07:42:36,479 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:36,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 111 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:42:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 07:42:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2025-02-08 07:42:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 101 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2025-02-08 07:42:36,482 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 56 [2025-02-08 07:42:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:36,482 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2025-02-08 07:42:36,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-02-08 07:42:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2025-02-08 07:42:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:42:36,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:36,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:36,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:42:36,483 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:36,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:36,483 INFO L85 PathProgramCache]: Analyzing trace with hash -255687443, now seen corresponding path program 1 times [2025-02-08 07:42:36,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:36,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949900265] [2025-02-08 07:42:36,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:36,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:36,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:42:36,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:42:36,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:36,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:36,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:36,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949900265] [2025-02-08 07:42:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949900265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:36,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:36,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 07:42:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473887152] [2025-02-08 07:42:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:36,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 07:42:36,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:36,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 07:42:36,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 07:42:36,979 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-02-08 07:42:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:37,176 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2025-02-08 07:42:37,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:42:37,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 57 [2025-02-08 07:42:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:37,177 INFO L225 Difference]: With dead ends: 113 [2025-02-08 07:42:37,177 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 07:42:37,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:42:37,178 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 86 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:37,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 195 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:42:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 07:42:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-02-08 07:42:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 107 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-02-08 07:42:37,181 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 57 [2025-02-08 07:42:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:37,181 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-02-08 07:42:37,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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-02-08 07:42:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-02-08 07:42:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:42:37,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:37,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:37,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 07:42:37,184 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:37,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash -255687442, now seen corresponding path program 1 times [2025-02-08 07:42:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417990288] [2025-02-08 07:42:37,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:37,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:42:37,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:42:37,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:37,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:37,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417990288] [2025-02-08 07:42:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417990288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:37,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:37,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:42:37,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792215204] [2025-02-08 07:42:37,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:37,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:42:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:37,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:42:37,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:42:37,954 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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-02-08 07:42:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:38,145 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2025-02-08 07:42:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:42:38,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 57 [2025-02-08 07:42:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:38,146 INFO L225 Difference]: With dead ends: 112 [2025-02-08 07:42:38,146 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 07:42:38,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:42:38,147 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 50 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:38,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 153 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 07:42:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-08 07:42:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 107 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2025-02-08 07:42:38,149 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 57 [2025-02-08 07:42:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:38,149 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2025-02-08 07:42:38,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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-02-08 07:42:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2025-02-08 07:42:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 07:42:38,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:38,150 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:38,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 07:42:38,150 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:38,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:38,150 INFO L85 PathProgramCache]: Analyzing trace with hash 292539402, now seen corresponding path program 1 times [2025-02-08 07:42:38,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:38,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763723575] [2025-02-08 07:42:38,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:38,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:38,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:42:38,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:42:38,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:38,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:38,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:38,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763723575] [2025-02-08 07:42:38,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763723575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:38,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612580216] [2025-02-08 07:42:38,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:38,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:38,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:38,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:38,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:42:38,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:42:38,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:42:38,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:38,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:38,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:42:38,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:38,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612580216] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:38,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:42:38,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:42:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863909015] [2025-02-08 07:42:38,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:38,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:42:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:38,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:42:38,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:42:38,564 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-02-08 07:42:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:38,604 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2025-02-08 07:42:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:42:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 61 [2025-02-08 07:42:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:38,605 INFO L225 Difference]: With dead ends: 141 [2025-02-08 07:42:38,605 INFO L226 Difference]: Without dead ends: 141 [2025-02-08 07:42:38,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:42:38,606 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:38,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 169 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:42:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-08 07:42:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2025-02-08 07:42:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.264957264957265) internal successors, (148), 131 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2025-02-08 07:42:38,609 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 61 [2025-02-08 07:42:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:38,609 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2025-02-08 07:42:38,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-02-08 07:42:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2025-02-08 07:42:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 07:42:38,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:38,610 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:38,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 07:42:38,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:38,814 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:38,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash 479033477, now seen corresponding path program 1 times [2025-02-08 07:42:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:38,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509740004] [2025-02-08 07:42:38,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:38,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:42:38,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:42:38,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:38,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:39,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509740004] [2025-02-08 07:42:39,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509740004] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830983444] [2025-02-08 07:42:39,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:39,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:39,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:39,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:39,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:42:39,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:42:39,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:42:39,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:39,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:39,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 07:42:39,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:39,552 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 10 treesize of output 8 [2025-02-08 07:42:39,579 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 07:42:39,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 07:42:39,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:42:39,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-08 07:42:39,706 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:42:39,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-08 07:42:39,760 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:42:39,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-08 07:42:39,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2025-02-08 07:42:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 07:42:39,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:39,916 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1917 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_1917))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1918)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:42:43,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1916 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1916))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1917)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1918)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:42:44,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:42:44,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-02-08 07:42:44,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4920 treesize of output 3952 [2025-02-08 07:42:44,044 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 587 treesize of output 467 [2025-02-08 07:42:44,048 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 467 treesize of output 419 [2025-02-08 07:42:44,053 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 419 treesize of output 335 [2025-02-08 07:42:45,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:42:45,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 178 treesize of output 876 [2025-02-08 07:42:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:58,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830983444] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:58,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:42:58,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2025-02-08 07:42:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046299359] [2025-02-08 07:42:58,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:58,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 07:42:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:58,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 07:42:58,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=352, Unknown=21, NotChecked=82, Total=552 [2025-02-08 07:42:58,405 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-02-08 07:42:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:58,736 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2025-02-08 07:42:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:42:58,739 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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 62 [2025-02-08 07:42:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:58,740 INFO L225 Difference]: With dead ends: 135 [2025-02-08 07:42:58,740 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 07:42:58,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=128, Invalid=411, Unknown=21, NotChecked=90, Total=650 [2025-02-08 07:42:58,741 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 42 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:58,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 271 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 254 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2025-02-08 07:42:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 07:42:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-08 07:42:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.2136752136752136) internal successors, (142), 130 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2025-02-08 07:42:58,750 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 62 [2025-02-08 07:42:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:58,750 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2025-02-08 07:42:58,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-02-08 07:42:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2025-02-08 07:42:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 07:42:58,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:58,751 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:58,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 07:42:58,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-08 07:42:58,952 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:58,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash 479033478, now seen corresponding path program 1 times [2025-02-08 07:42:58,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:58,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067852632] [2025-02-08 07:42:58,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:58,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:42:58,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:42:58,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:58,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:59,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:59,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067852632] [2025-02-08 07:42:59,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067852632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:59,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243661780] [2025-02-08 07:42:59,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:59,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:59,836 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:59,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:42:59,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:43:00,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:43:00,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:00,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:00,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 07:43:00,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:00,109 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 10 treesize of output 8 [2025-02-08 07:43:00,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:43:00,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:43:00,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:43:00,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 07:43:00,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:43:00,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-08 07:43:00,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 07:43:00,338 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:00,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:43:00,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:43:00,447 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:00,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:43:00,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:43:00,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2025-02-08 07:43:00,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 07:43:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:00,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:00,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2149 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2148) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:43:00,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2149 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2148) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:43:00,659 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2148) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2149 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2025-02-08 07:43:00,673 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2146 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2146))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2147) .cse0 v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2148) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2146 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2147) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2146) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2025-02-08 07:43:00,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2146 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2146))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2147) .cse1 v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2148) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2146 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2147) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2146) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)))))) is different from false [2025-02-08 07:43:00,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2145 (Array Int Int)) (v_ArrVal_2144 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2145))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2146))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2144) .cse0 v_ArrVal_2147) .cse1 v_ArrVal_2149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2148) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2145 (Array Int Int)) (v_ArrVal_2144 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2145))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2144) .cse5 v_ArrVal_2147) (select (select (store .cse6 .cse5 v_ArrVal_2146) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2149))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))))) is different from false [2025-02-08 07:43:00,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:00,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2025-02-08 07:43:00,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:00,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2025-02-08 07:43:00,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 454 treesize of output 374 [2025-02-08 07:43:00,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1302 treesize of output 1230 [2025-02-08 07:43:00,769 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 146 treesize of output 122 [2025-02-08 07:43:00,772 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 122 treesize of output 110 [2025-02-08 07:43:00,774 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 110 treesize of output 98 [2025-02-08 07:43:00,778 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 57 treesize of output 45 [2025-02-08 07:43:00,786 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 45 treesize of output 39 [2025-02-08 07:43:00,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:00,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 210 [2025-02-08 07:43:00,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:00,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 126 [2025-02-08 07:43:00,824 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:00,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 354 [2025-02-08 07:43:00,840 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:00,840 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:00,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-08 07:43:00,930 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:43:00,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 07:43:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-02-08 07:43:00,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243661780] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:00,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:00,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2025-02-08 07:43:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984208276] [2025-02-08 07:43:00,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:00,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 07:43:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:00,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 07:43:00,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=557, Unknown=6, NotChecked=318, Total=992 [2025-02-08 07:43:00,938 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 states have internal predecessors, (71), 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-02-08 07:43:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:01,712 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2025-02-08 07:43:01,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:43:01,713 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 states have internal predecessors, (71), 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 62 [2025-02-08 07:43:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:01,713 INFO L225 Difference]: With dead ends: 135 [2025-02-08 07:43:01,714 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 07:43:01,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=868, Unknown=6, NotChecked=402, Total=1482 [2025-02-08 07:43:01,714 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 153 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:01,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 367 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 502 Invalid, 0 Unknown, 349 Unchecked, 0.4s Time] [2025-02-08 07:43:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 07:43:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-08 07:43:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 130 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2025-02-08 07:43:01,717 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 62 [2025-02-08 07:43:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:01,717 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2025-02-08 07:43:01,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 states have internal predecessors, (71), 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-02-08 07:43:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2025-02-08 07:43:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 07:43:01,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:01,718 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:01,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 07:43:01,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:01,918 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:01,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1812136942, now seen corresponding path program 2 times [2025-02-08 07:43:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:01,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082040972] [2025-02-08 07:43:01,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:43:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:01,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 07:43:01,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 07:43:01,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:43:01,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:02,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:02,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082040972] [2025-02-08 07:43:02,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082040972] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:02,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127115698] [2025-02-08 07:43:02,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:43:02,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:02,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:02,986 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:02,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:43:03,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 07:43:03,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 07:43:03,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:43:03,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:03,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 07:43:03,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:03,407 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 07:43:03,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2025-02-08 07:43:03,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:43:03,433 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:43:03,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:43:03,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 07:43:03,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:43:03,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-08 07:43:03,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 07:43:03,616 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:03,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:43:03,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:43:03,724 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:03,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:43:03,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:43:03,831 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:03,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:43:03,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:43:03,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2025-02-08 07:43:03,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 07:43:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:03,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:04,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2395) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))))) is different from false [2025-02-08 07:43:04,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2395) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1)))))) is different from false [2025-02-08 07:43:04,042 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2396 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2395) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:43:04,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2394) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2393) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2393))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2394) .cse1 v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2395) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:43:04,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2393))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2394) .cse1 v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2395) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2394) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2393) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2025-02-08 07:43:04,090 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (<= 0 (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2394) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2393) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2393))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2394) .cse2 v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2395) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-02-08 07:43:04,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2392))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2393))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2391) .cse0 v_ArrVal_2394) .cse1 v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2395) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (<= 0 (+ 2 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2392))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2391) .cse5 v_ArrVal_2394) (select (select (store .cse6 .cse5 v_ArrVal_2393) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2396))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2025-02-08 07:43:04,522 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2395 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2390))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2392))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2393))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2389) .cse0 v_ArrVal_2391) .cse1 v_ArrVal_2394) .cse2 v_ArrVal_2396) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2395) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2391 (Array Int Int)) (v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2396 (Array Int Int)) (v_ArrVal_2394 (Array Int Int)) (v_ArrVal_2393 (Array Int Int)) (v_ArrVal_2392 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2390))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2392))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2389) .cse7 v_ArrVal_2391) .cse8 v_ArrVal_2394) (select (select (store .cse9 .cse8 v_ArrVal_2393) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2396))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))))) is different from false [2025-02-08 07:43:04,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:04,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 211 [2025-02-08 07:43:04,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:04,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 127 [2025-02-08 07:43:04,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37348 treesize of output 31660 [2025-02-08 07:43:04,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 717337 treesize of output 702097 [2025-02-08 07:43:04,983 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 4611 treesize of output 3843 [2025-02-08 07:43:05,002 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 3843 treesize of output 3717 [2025-02-08 07:43:05,022 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 3717 treesize of output 3639 [2025-02-08 07:43:05,041 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 3639 treesize of output 3327 [2025-02-08 07:43:05,059 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 3327 treesize of output 2901 [2025-02-08 07:43:05,078 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 2901 treesize of output 2601 [2025-02-08 07:43:05,097 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 2601 treesize of output 2523 [2025-02-08 07:43:05,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:05,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 418 [2025-02-08 07:43:05,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:05,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 238 [2025-02-08 07:43:05,868 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:05,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43874 treesize of output 29354 [2025-02-08 07:43:05,908 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:05,908 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:05,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-08 07:43:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 13 not checked. [2025-02-08 07:43:06,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127115698] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:06,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:06,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 40 [2025-02-08 07:43:06,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855792272] [2025-02-08 07:43:06,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:06,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-08 07:43:06,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:06,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-08 07:43:06,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=907, Unknown=13, NotChecked=552, Total=1640 [2025-02-08 07:43:06,034 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 41 states, 40 states have (on average 2.225) internal successors, (89), 41 states have internal predecessors, (89), 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-02-08 07:43:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:07,075 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2025-02-08 07:43:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:43:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.225) internal successors, (89), 41 states have internal predecessors, (89), 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 67 [2025-02-08 07:43:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:07,076 INFO L225 Difference]: With dead ends: 135 [2025-02-08 07:43:07,076 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 07:43:07,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=325, Invalid=1500, Unknown=13, NotChecked=712, Total=2550 [2025-02-08 07:43:07,077 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 172 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 514 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:07,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 367 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 508 Invalid, 0 Unknown, 514 Unchecked, 0.4s Time] [2025-02-08 07:43:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 07:43:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-08 07:43:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.1794871794871795) internal successors, (138), 130 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2025-02-08 07:43:07,080 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 67 [2025-02-08 07:43:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:07,081 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2025-02-08 07:43:07,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.225) internal successors, (89), 41 states have internal predecessors, (89), 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-02-08 07:43:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2025-02-08 07:43:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 07:43:07,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:07,081 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:07,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 07:43:07,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:07,282 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:07,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1623480710, now seen corresponding path program 3 times [2025-02-08 07:43:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:07,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083568262] [2025-02-08 07:43:07,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:43:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:07,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-02-08 07:43:07,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 72 statements. [2025-02-08 07:43:07,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 07:43:07,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:08,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:08,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083568262] [2025-02-08 07:43:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083568262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:08,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231396402] [2025-02-08 07:43:08,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:43:08,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:08,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:08,927 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:08,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 07:43:09,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-02-08 07:43:09,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 72 statements. [2025-02-08 07:43:09,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 07:43:09,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:09,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 07:43:09,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:09,860 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 10 treesize of output 8 [2025-02-08 07:43:09,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:43:09,885 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:43:09,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:43:09,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 07:43:09,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 07:43:09,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-08 07:43:09,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 07:43:10,004 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:10,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:43:10,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:43:10,091 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:10,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:43:10,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:43:10,196 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:10,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:43:10,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:43:10,309 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:10,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-08 07:43:10,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-08 07:43:10,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2025-02-08 07:43:10,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 07:43:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:10,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:10,551 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2654 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:43:10,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2654 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:43:10,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2653) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2652) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2652))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2653) .cse1 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:43:10,663 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2652))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2653) .cse1 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2653) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2652) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3)))))) is different from false [2025-02-08 07:43:10,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2650))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2652))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2651) .cse0 v_ArrVal_2653) .cse1 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2650))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2651) .cse5 v_ArrVal_2653) (select (select (store .cse6 .cse5 v_ArrVal_2652) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2654))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3))))) is different from false [2025-02-08 07:43:10,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2650))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2651) .cse1 v_ArrVal_2653) (select (select (store .cse2 .cse1 v_ArrVal_2652) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2654))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3))) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2650))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2652))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2651) .cse4 v_ArrVal_2653) .cse5 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-02-08 07:43:10,857 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2649))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2650))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2648) .cse0 v_ArrVal_2651) .cse1 v_ArrVal_2653) (select (select (store .cse2 .cse1 v_ArrVal_2652) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2654))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2649))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2650))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2652))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2648) .cse5 v_ArrVal_2651) .cse6 v_ArrVal_2653) .cse7 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-02-08 07:43:25,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2647 (Array Int Int)) (v_ArrVal_2646 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2647))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2649))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2650))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2646) .cse0 v_ArrVal_2648) .cse1 v_ArrVal_2651) .cse2 v_ArrVal_2653) (select (select (store .cse3 .cse2 v_ArrVal_2652) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2654))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2647 (Array Int Int)) (v_ArrVal_2646 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int)) (v_ArrVal_2651 (Array Int Int)) (v_ArrVal_2650 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2647))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2649))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2650))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2652))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2646) .cse7 v_ArrVal_2648) .cse8 v_ArrVal_2651) .cse9 v_ArrVal_2653) .cse10 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))) is different from false [2025-02-08 07:43:25,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:25,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 833 treesize of output 834 [2025-02-08 07:43:25,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:25,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 821 treesize of output 462 [2025-02-08 07:43:26,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 525466046 treesize of output 482784230 [2025-02-08 07:43:36,167 WARN L286 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 8768 DAG size of output: 206 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-08 07:43:36,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 67289445 treesize of output 66821741 [2025-02-08 07:43:37,066 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 2883 treesize of output 2529 [2025-02-08 07:43:37,096 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 2529 treesize of output 2433 [2025-02-08 07:43:37,128 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 2433 treesize of output 2001 [2025-02-08 07:43:37,162 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 2001 treesize of output 1821 [2025-02-08 07:43:37,193 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 1821 treesize of output 1797 [2025-02-08 07:43:37,223 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 1797 treesize of output 1491 [2025-02-08 07:43:37,255 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 1491 treesize of output 1467 [2025-02-08 07:43:37,310 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 1467 treesize of output 1347 [2025-02-08 07:43:37,341 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 1347 treesize of output 1227 [2025-02-08 07:43:37,383 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 1227 treesize of output 1215 [2025-02-08 07:43:38,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:38,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 418 treesize of output 419 [2025-02-08 07:43:38,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:38,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 406 treesize of output 239 [2025-02-08 07:43:38,753 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:38,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11100 treesize of output 7556 [2025-02-08 07:43:38,790 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:38,790 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:38,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-02-08 07:43:39,987 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:43:39,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 07:43:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 145 trivial. 19 not checked. [2025-02-08 07:43:40,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231396402] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:40,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:40,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 19] total 41 [2025-02-08 07:43:40,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222442214] [2025-02-08 07:43:40,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:40,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 07:43:40,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:40,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 07:43:40,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=929, Unknown=37, NotChecked=568, Total=1722 [2025-02-08 07:43:40,057 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand has 42 states, 41 states have (on average 2.268292682926829) internal successors, (93), 42 states have internal predecessors, (93), 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-02-08 07:43:53,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (<= (+ |c_ULTIMATE.start_main_~j~0#1| .cse0 1) (select |c_#length| .cse1)) (forall ((v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2653) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2652) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2653) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2652) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 2))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| .cse0)) (<= 0 (+ |c_ULTIMATE.start_main_#t~mem158#1.offset| |c_ULTIMATE.start_main_~j~0#1|)) (<= (+ |c_ULTIMATE.start_main_#t~mem158#1.offset| |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| |c_ULTIMATE.start_main_#t~mem158#1.base|)) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|)) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2652))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2653) .cse3 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2652))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2653) .cse5 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2654 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base|) 1)))) is different from false [2025-02-08 07:43:53,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2653) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2652) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2))) (<= 0 (+ |c_ULTIMATE.start_main_#t~mem158#1.offset| |c_ULTIMATE.start_main_~j~0#1|)) (<= (+ |c_ULTIMATE.start_main_#t~mem158#1.offset| |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| |c_ULTIMATE.start_main_#t~mem158#1.base|)) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2652 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2652))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2653) .cse1 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) (forall ((v_ArrVal_2654 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:43:54,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2654 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| .cse2 1) (select |c_#length| .cse0)) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| .cse2)) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:43:55,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (<= 0 (+ |c_ULTIMATE.start_main_#t~mem158#1.offset| |c_ULTIMATE.start_main_~j~0#1|)) (<= (+ |c_ULTIMATE.start_main_#t~mem158#1.offset| |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| |c_ULTIMATE.start_main_#t~mem158#1.base|)) (forall ((v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2655) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2654 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2654) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false