./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/sync-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/sync-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3e9a9e28ec707ec387b70e5fb29d6b347c7ed8919bb4c21e62aca8b2b5a70bf5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:28:53,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:28:53,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:28:53,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:28:53,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:28:53,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:28:53,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:28:53,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:28:53,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:28:53,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:28:53,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:28:53,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:28:53,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:28:53,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:28:53,681 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:28:53,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:28:53,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:28:53,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:28:53,682 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:28:53,682 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:28:53,682 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:28:53,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:28:53,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:28:53,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:28:53,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:28:53,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:28:53,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:28:53,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:28:53,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:28:53,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:28:53,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:28:53,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:28:53,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:28:53,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:28:53,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:28:53,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:28:53,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:28:53,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:28:53,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:28:53,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e9a9e28ec707ec387b70e5fb29d6b347c7ed8919bb4c21e62aca8b2b5a70bf5 [2025-03-09 00:28:53,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:28:53,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:28:53,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:28:53,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:28:53,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:28:53,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/sync-2.i [2025-03-09 00:28:55,134 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1e133ba/0f42370a1d774e74a8b043d00c52dbb8/FLAGd906649fa [2025-03-09 00:28:55,482 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:28:55,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sync-2.i [2025-03-09 00:28:55,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1e133ba/0f42370a1d774e74a8b043d00c52dbb8/FLAGd906649fa [2025-03-09 00:28:55,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1e133ba/0f42370a1d774e74a8b043d00c52dbb8 [2025-03-09 00:28:55,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:28:55,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:28:55,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:28:55,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:28:55,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:28:55,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:28:55" (1/1) ... [2025-03-09 00:28:55,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5bab72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:55, skipping insertion in model container [2025-03-09 00:28:55,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:28:55" (1/1) ... [2025-03-09 00:28:55,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:28:56,273 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,275 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,278 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,279 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,281 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,282 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,282 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,285 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,285 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,287 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,290 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,291 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,298 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,298 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,306 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,320 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 00:28:56,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:28:56,354 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:28:56,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:28:56,592 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 00:28:56,599 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:28:56,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56 WrapperNode [2025-03-09 00:28:56,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:28:56,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:28:56,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:28:56,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:28:56,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,702 INFO L138 Inliner]: procedures = 540, calls = 474, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 702 [2025-03-09 00:28:56,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:28:56,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:28:56,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:28:56,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:28:56,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,749 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 00:28:56,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:28:56,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:28:56,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:28:56,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:28:56,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (1/1) ... [2025-03-09 00:28:56,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:28:56,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:28:56,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:28:56,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:28:56,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:28:56,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 00:28:56,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 00:28:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 00:28:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:28:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:28:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 00:28:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:28:56,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:28:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 00:28:56,875 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 00:28:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 00:28:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 00:28:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:28:56,875 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:28:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:28:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 00:28:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 00:28:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 00:28:57,090 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:28:57,092 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:28:57,827 INFO L? ?]: Removed 329 outVars from TransFormulas that were not future-live. [2025-03-09 00:28:57,827 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:28:57,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:28:57,856 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:28:57,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:28:57 BoogieIcfgContainer [2025-03-09 00:28:57,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:28:57,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:28:57,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:28:57,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:28:57,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:28:55" (1/3) ... [2025-03-09 00:28:57,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c488132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:28:57, skipping insertion in model container [2025-03-09 00:28:57,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:28:56" (2/3) ... [2025-03-09 00:28:57,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c488132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:28:57, skipping insertion in model container [2025-03-09 00:28:57,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:28:57" (3/3) ... [2025-03-09 00:28:57,867 INFO L128 eAbstractionObserver]: Analyzing ICFG sync-2.i [2025-03-09 00:28:57,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:28:57,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sync-2.i that has 3 procedures, 263 locations, 1 initial locations, 11 loop locations, and 107 error locations. [2025-03-09 00:28:57,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:28:57,939 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;@27df86a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:28:57,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 107 error locations. [2025-03-09 00:28:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 148 states have (on average 1.9256756756756757) internal successors, (285), 255 states have internal predecessors, (285), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 00:28:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:28:57,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:57,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:28:57,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:28:57,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash 337587, now seen corresponding path program 1 times [2025-03-09 00:28:57,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:57,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640312239] [2025-03-09 00:28:57,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:57,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:58,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:28:58,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:28:58,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:58,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:58,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:58,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640312239] [2025-03-09 00:28:58,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640312239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:58,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681278334] [2025-03-09 00:28:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:58,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:58,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:58,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:58,628 INFO L87 Difference]: Start difference. First operand has 263 states, 148 states have (on average 1.9256756756756757) internal successors, (285), 255 states have internal predecessors, (285), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:58,747 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2025-03-09 00:28:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:58,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:28:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:58,755 INFO L225 Difference]: With dead ends: 122 [2025-03-09 00:28:58,755 INFO L226 Difference]: Without dead ends: 120 [2025-03-09 00:28:58,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:58,761 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 71 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:58,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 102 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:28:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-09 00:28:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2025-03-09 00:28:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 98 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:58,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-03-09 00:28:58,793 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 3 [2025-03-09 00:28:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:58,793 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-03-09 00:28:58,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-03-09 00:28:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:28:58,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:58,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:28:58,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:28:58,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:28:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash 337588, now seen corresponding path program 1 times [2025-03-09 00:28:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111961529] [2025-03-09 00:28:58,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:58,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:28:58,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:28:58,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:58,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:59,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:59,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111961529] [2025-03-09 00:28:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111961529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:59,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:28:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069872027] [2025-03-09 00:28:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:59,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:28:59,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:59,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:28:59,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:59,120 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:59,223 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-03-09 00:28:59,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:28:59,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:28:59,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:59,225 INFO L225 Difference]: With dead ends: 100 [2025-03-09 00:28:59,226 INFO L226 Difference]: Without dead ends: 100 [2025-03-09 00:28:59,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:28:59,227 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:28:59,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 159 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:28:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-09 00:28:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-09 00:28:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 97 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-03-09 00:28:59,235 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 3 [2025-03-09 00:28:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:59,235 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-03-09 00:28:59,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-03-09 00:28:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:28:59,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:59,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:28:59,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:28:59,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:28:59,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:59,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1467392766, now seen corresponding path program 1 times [2025-03-09 00:28:59,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:59,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349480983] [2025-03-09 00:28:59,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:59,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:28:59,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:28:59,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:59,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:28:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:28:59,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:28:59,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349480983] [2025-03-09 00:28:59,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349480983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:28:59,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:28:59,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:28:59,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400609349] [2025-03-09 00:28:59,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:28:59,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:28:59,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:28:59,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:28:59,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:28:59,576 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:28:59,701 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2025-03-09 00:28:59,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:28:59,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 00:28:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:28:59,702 INFO L225 Difference]: With dead ends: 103 [2025-03-09 00:28:59,703 INFO L226 Difference]: Without dead ends: 103 [2025-03-09 00:28:59,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:28:59,704 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 10 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 220 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-03-09 00:28:59,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 220 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:28:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-09 00:28:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-09 00:28:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.721311475409836) internal successors, (105), 99 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:28:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2025-03-09 00:28:59,715 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 6 [2025-03-09 00:28:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:28:59,715 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2025-03-09 00:28:59,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:28:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2025-03-09 00:28:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:28:59,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:28:59,716 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:28:59,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:28:59,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:28:59,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:28:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 920991663, now seen corresponding path program 1 times [2025-03-09 00:28:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:28:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610796659] [2025-03-09 00:28:59,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:28:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:28:59,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:28:59,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:28:59,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:28:59,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:00,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:00,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610796659] [2025-03-09 00:29:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610796659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:00,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126581270] [2025-03-09 00:29:00,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:00,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:00,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:00,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:00,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:29:00,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:29:00,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:29:00,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:00,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:00,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:29:00,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:00,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:00,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-09 00:29:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:00,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126581270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:00,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:00,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:29:00,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021700594] [2025-03-09 00:29:00,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:00,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:29:00,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:00,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:29:00,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:29:00,515 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:00,823 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2025-03-09 00:29:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:29:00,823 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:29:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:00,825 INFO L225 Difference]: With dead ends: 106 [2025-03-09 00:29:00,825 INFO L226 Difference]: Without dead ends: 106 [2025-03-09 00:29:00,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:29:00,826 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 88 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:00,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 604 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 00:29:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-09 00:29:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-09 00:29:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 103 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2025-03-09 00:29:00,831 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 9 [2025-03-09 00:29:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:00,832 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2025-03-09 00:29:00,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2025-03-09 00:29:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 00:29:00,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:00,832 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:00,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:29:01,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:01,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:01,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:01,035 INFO L85 PathProgramCache]: Analyzing trace with hash -22207314, now seen corresponding path program 1 times [2025-03-09 00:29:01,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:01,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110472932] [2025-03-09 00:29:01,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:01,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:01,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:29:01,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:29:01,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:01,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:01,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110472932] [2025-03-09 00:29:01,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110472932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864095388] [2025-03-09 00:29:01,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:01,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:01,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:29:01,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:29:01,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:29:01,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:01,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:01,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:29:01,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:01,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864095388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:01,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:01,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 00:29:01,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482246063] [2025-03-09 00:29:01,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:01,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:29:01,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:01,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:29:01,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:29:01,530 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:01,577 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2025-03-09 00:29:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 00:29:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 00:29:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:01,579 INFO L225 Difference]: With dead ends: 121 [2025-03-09 00:29:01,579 INFO L226 Difference]: Without dead ends: 121 [2025-03-09 00:29:01,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:29:01,580 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 4 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:01,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 395 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:29:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-09 00:29:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-09 00:29:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 118 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2025-03-09 00:29:01,586 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 15 [2025-03-09 00:29:01,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:01,586 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2025-03-09 00:29:01,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2025-03-09 00:29:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:29:01,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:01,587 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:01,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:29:01,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:01,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:01,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2117022755, now seen corresponding path program 2 times [2025-03-09 00:29:01,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:01,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484311879] [2025-03-09 00:29:01,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:01,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:01,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 00:29:01,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-03-09 00:29:01,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:29:01,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-09 00:29:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:02,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484311879] [2025-03-09 00:29:02,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484311879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:02,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:02,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:29:02,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210151418] [2025-03-09 00:29:02,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:02,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:29:02,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:02,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:29:02,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:02,055 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:02,136 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2025-03-09 00:29:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:02,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-09 00:29:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:02,137 INFO L225 Difference]: With dead ends: 139 [2025-03-09 00:29:02,137 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 00:29:02,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:02,138 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 142 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:02,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 00:29:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2025-03-09 00:29:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 117 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2025-03-09 00:29:02,142 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 30 [2025-03-09 00:29:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:02,143 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2025-03-09 00:29:02,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2025-03-09 00:29:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 00:29:02,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:02,143 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:02,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:29:02,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:02,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2117022754, now seen corresponding path program 1 times [2025-03-09 00:29:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:02,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097092949] [2025-03-09 00:29:02,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:02,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:02,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:29:02,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:29:02,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:02,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:02,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:02,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097092949] [2025-03-09 00:29:02,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097092949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:02,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929113111] [2025-03-09 00:29:02,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:02,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:02,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:02,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:02,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:29:02,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 00:29:02,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 00:29:02,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:02,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:02,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 00:29:02,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:02,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929113111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:02,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-03-09 00:29:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177783589] [2025-03-09 00:29:02,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:02,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:29:02,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:02,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:29:02,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:29:02,852 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:02,908 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2025-03-09 00:29:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:29:02,909 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-09 00:29:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:02,909 INFO L225 Difference]: With dead ends: 126 [2025-03-09 00:29:02,909 INFO L226 Difference]: Without dead ends: 126 [2025-03-09 00:29:02,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:29:02,910 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:02,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 488 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:29:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-09 00:29:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-09 00:29:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 123 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2025-03-09 00:29:02,915 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 30 [2025-03-09 00:29:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:02,915 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2025-03-09 00:29:02,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2025-03-09 00:29:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:29:02,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:02,916 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:02,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:29:03,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:03,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:03,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 230924862, now seen corresponding path program 2 times [2025-03-09 00:29:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:03,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283805210] [2025-03-09 00:29:03,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:03,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:29:03,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-09 00:29:03,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:29:03,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:03,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:03,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283805210] [2025-03-09 00:29:03,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283805210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:03,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:03,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:29:03,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663582656] [2025-03-09 00:29:03,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:03,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:29:03,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:03,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:29:03,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:29:03,396 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:03,505 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2025-03-09 00:29:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:03,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-09 00:29:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:03,506 INFO L225 Difference]: With dead ends: 144 [2025-03-09 00:29:03,506 INFO L226 Difference]: Without dead ends: 144 [2025-03-09 00:29:03,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:03,507 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 180 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:03,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 82 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-09 00:29:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2025-03-09 00:29:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 87 states have (on average 1.471264367816092) internal successors, (128), 122 states have internal predecessors, (128), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2025-03-09 00:29:03,516 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 36 [2025-03-09 00:29:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:03,517 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2025-03-09 00:29:03,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2025-03-09 00:29:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:29:03,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:03,519 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:03,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:29:03,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:03,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:03,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2133955600, now seen corresponding path program 1 times [2025-03-09 00:29:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:03,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060021592] [2025-03-09 00:29:03,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:03,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:03,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:29:03,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:29:03,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:03,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060021592] [2025-03-09 00:29:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060021592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:03,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:03,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:29:03,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703511496] [2025-03-09 00:29:03,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:03,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:29:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:03,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:29:03,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:03,832 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:03,897 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2025-03-09 00:29:03,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:03,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-09 00:29:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:03,898 INFO L225 Difference]: With dead ends: 139 [2025-03-09 00:29:03,898 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 00:29:03,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:03,899 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 51 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:03,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 00:29:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 120. [2025-03-09 00:29:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 117 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2025-03-09 00:29:03,903 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 44 [2025-03-09 00:29:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:03,903 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2025-03-09 00:29:03,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2025-03-09 00:29:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:29:03,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:03,904 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:03,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:29:03,904 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:03,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:03,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2133955599, now seen corresponding path program 1 times [2025-03-09 00:29:03,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:03,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175685489] [2025-03-09 00:29:03,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:03,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:29:04,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:29:04,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:04,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:04,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:04,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175685489] [2025-03-09 00:29:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175685489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:04,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:04,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:29:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327868910] [2025-03-09 00:29:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:04,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:29:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:04,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:29:04,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:04,639 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:04,708 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2025-03-09 00:29:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:04,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-09 00:29:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:04,709 INFO L225 Difference]: With dead ends: 138 [2025-03-09 00:29:04,709 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 00:29:04,709 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-03-09 00:29:04,714 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 102 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:04,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 310 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 00:29:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2025-03-09 00:29:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 116 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2025-03-09 00:29:04,722 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 44 [2025-03-09 00:29:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:04,722 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2025-03-09 00:29:04,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2025-03-09 00:29:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:29:04,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:04,723 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:04,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:29:04,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:04,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1434892945, now seen corresponding path program 1 times [2025-03-09 00:29:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:04,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245458729] [2025-03-09 00:29:04,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:04,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:29:04,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:29:04,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:04,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:05,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245458729] [2025-03-09 00:29:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245458729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:05,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:05,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:29:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331052759] [2025-03-09 00:29:05,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:05,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:29:05,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:05,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:29:05,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:05,145 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:05,271 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2025-03-09 00:29:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:29:05,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-09 00:29:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:05,272 INFO L225 Difference]: With dead ends: 156 [2025-03-09 00:29:05,272 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 00:29:05,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:05,273 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 118 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:05,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 177 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 00:29:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2025-03-09 00:29:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 129 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2025-03-09 00:29:05,278 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 47 [2025-03-09 00:29:05,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:05,279 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2025-03-09 00:29:05,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2025-03-09 00:29:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:29:05,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:05,280 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:05,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:29:05,280 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:05,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1434892016, now seen corresponding path program 1 times [2025-03-09 00:29:05,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:05,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783721622] [2025-03-09 00:29:05,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:05,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:05,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:29:05,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:29:05,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:05,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:05,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:05,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783721622] [2025-03-09 00:29:05,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783721622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:05,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:05,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:29:05,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218452720] [2025-03-09 00:29:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:05,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:29:05,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:05,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:29:05,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:29:05,497 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:05,610 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2025-03-09 00:29:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:29:05,611 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), 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 47 [2025-03-09 00:29:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:05,612 INFO L225 Difference]: With dead ends: 150 [2025-03-09 00:29:05,612 INFO L226 Difference]: Without dead ends: 150 [2025-03-09 00:29:05,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-09 00:29:05,617 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:05,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 154 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-09 00:29:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 131. [2025-03-09 00:29:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 128 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2025-03-09 00:29:05,624 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 47 [2025-03-09 00:29:05,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:05,628 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2025-03-09 00:29:05,628 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2025-03-09 00:29:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:29:05,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:05,629 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:05,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:29:05,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:05,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1434892017, now seen corresponding path program 1 times [2025-03-09 00:29:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:05,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403406342] [2025-03-09 00:29:05,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:05,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:29:05,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:29:05,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:05,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403406342] [2025-03-09 00:29:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403406342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:05,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:05,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:29:05,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976261603] [2025-03-09 00:29:05,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:05,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:29:05,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:05,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:29:05,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:29:05,921 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:05,977 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2025-03-09 00:29:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:05,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-09 00:29:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:05,978 INFO L225 Difference]: With dead ends: 136 [2025-03-09 00:29:05,978 INFO L226 Difference]: Without dead ends: 136 [2025-03-09 00:29:05,978 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-03-09 00:29:05,979 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 78 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:05,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 333 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:29:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-09 00:29:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2025-03-09 00:29:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 101 states have (on average 1.396039603960396) internal successors, (141), 128 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2025-03-09 00:29:05,983 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 47 [2025-03-09 00:29:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:05,984 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2025-03-09 00:29:05,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2025-03-09 00:29:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:29:05,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:05,987 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] [2025-03-09 00:29:05,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:29:05,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:05,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash -913550261, now seen corresponding path program 1 times [2025-03-09 00:29:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:05,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224852702] [2025-03-09 00:29:05,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:05,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:06,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:29:06,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:29:06,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:06,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224852702] [2025-03-09 00:29:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224852702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:06,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:06,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:29:06,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167161693] [2025-03-09 00:29:06,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:06,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:29:06,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:06,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:29:06,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:06,261 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:06,325 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2025-03-09 00:29:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 50 [2025-03-09 00:29:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:06,326 INFO L225 Difference]: With dead ends: 139 [2025-03-09 00:29:06,326 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 00:29:06,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:06,327 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 43 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:06,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 100 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 00:29:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2025-03-09 00:29:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.385321100917431) internal successors, (151), 135 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2025-03-09 00:29:06,330 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 50 [2025-03-09 00:29:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:06,331 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2025-03-09 00:29:06,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2025-03-09 00:29:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:29:06,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:06,331 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] [2025-03-09 00:29:06,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:29:06,331 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:06,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash -913550260, now seen corresponding path program 1 times [2025-03-09 00:29:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483612593] [2025-03-09 00:29:06,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:06,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:29:06,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:29:06,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:06,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:07,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483612593] [2025-03-09 00:29:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483612593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 00:29:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95282072] [2025-03-09 00:29:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:29:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:07,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:29:07,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:29:07,085 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:07,319 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2025-03-09 00:29:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:29:07,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 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 50 [2025-03-09 00:29:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:07,320 INFO L225 Difference]: With dead ends: 142 [2025-03-09 00:29:07,320 INFO L226 Difference]: Without dead ends: 142 [2025-03-09 00:29:07,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:29:07,321 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 31 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:07,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 220 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:29:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-09 00:29:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2025-03-09 00:29:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 135 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2025-03-09 00:29:07,325 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 50 [2025-03-09 00:29:07,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:07,325 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2025-03-09 00:29:07,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2025-03-09 00:29:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:29:07,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:07,326 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] [2025-03-09 00:29:07,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:29:07,326 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:07,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1632174473, now seen corresponding path program 1 times [2025-03-09 00:29:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076954471] [2025-03-09 00:29:07,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:07,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:29:07,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:29:07,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:07,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076954471] [2025-03-09 00:29:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076954471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:07,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:29:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895659367] [2025-03-09 00:29:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:07,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:29:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:07,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:29:07,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:29:07,728 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:07,845 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2025-03-09 00:29:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:07,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-03-09 00:29:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:07,846 INFO L225 Difference]: With dead ends: 137 [2025-03-09 00:29:07,846 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 00:29:07,846 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-03-09 00:29:07,847 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 53 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:07,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 217 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 00:29:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-09 00:29:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 134 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2025-03-09 00:29:07,850 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 53 [2025-03-09 00:29:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:07,850 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2025-03-09 00:29:07,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2025-03-09 00:29:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:29:07,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:07,854 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] [2025-03-09 00:29:07,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:29:07,854 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:07,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:07,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1632174474, now seen corresponding path program 1 times [2025-03-09 00:29:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054907526] [2025-03-09 00:29:07,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:07,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:29:07,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:29:07,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:07,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054907526] [2025-03-09 00:29:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054907526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:08,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:29:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134810305] [2025-03-09 00:29:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:08,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:29:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:08,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:29:08,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:29:08,485 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:08,626 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-03-09 00:29:08,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 53 [2025-03-09 00:29:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:08,627 INFO L225 Difference]: With dead ends: 136 [2025-03-09 00:29:08,627 INFO L226 Difference]: Without dead ends: 136 [2025-03-09 00:29:08,627 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-03-09 00:29:08,628 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 46 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:08,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 305 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-09 00:29:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-09 00:29:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 133 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-03-09 00:29:08,631 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 53 [2025-03-09 00:29:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:08,631 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-03-09 00:29:08,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-03-09 00:29:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 00:29:08,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:08,632 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] [2025-03-09 00:29:08,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:29:08,632 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:08,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1428443715, now seen corresponding path program 1 times [2025-03-09 00:29:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:08,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844047302] [2025-03-09 00:29:08,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:08,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 00:29:08,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 00:29:08,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:08,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844047302] [2025-03-09 00:29:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844047302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:08,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:08,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:29:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310396491] [2025-03-09 00:29:08,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:08,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:29:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:08,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:29:08,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:08,756 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-03-09 00:29:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:08,771 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2025-03-09 00:29:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:08,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-03-09 00:29:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:08,773 INFO L225 Difference]: With dead ends: 148 [2025-03-09 00:29:08,774 INFO L226 Difference]: Without dead ends: 148 [2025-03-09 00:29:08,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:08,774 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 171 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-03-09 00:29:08,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 171 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:29:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-09 00:29:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2025-03-09 00:29:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 135 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2025-03-09 00:29:08,778 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 57 [2025-03-09 00:29:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:08,779 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2025-03-09 00:29:08,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-03-09 00:29:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2025-03-09 00:29:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:29:08,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:08,779 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, 1] [2025-03-09 00:29:08,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:29:08,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1331835647, now seen corresponding path program 1 times [2025-03-09 00:29:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:08,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442869476] [2025-03-09 00:29:08,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:08,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:29:08,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:29:08,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:08,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442869476] [2025-03-09 00:29:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442869476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:09,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 00:29:09,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159346001] [2025-03-09 00:29:09,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:09,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:29:09,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:09,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:29:09,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:29:09,413 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:09,600 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-03-09 00:29:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:29:09,600 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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 58 [2025-03-09 00:29:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:09,601 INFO L225 Difference]: With dead ends: 152 [2025-03-09 00:29:09,601 INFO L226 Difference]: Without dead ends: 152 [2025-03-09 00:29:09,601 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-03-09 00:29:09,602 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 85 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:09,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 256 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-09 00:29:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2025-03-09 00:29:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 141 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2025-03-09 00:29:09,606 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 58 [2025-03-09 00:29:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:09,606 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2025-03-09 00:29:09,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2025-03-09 00:29:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:29:09,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:09,606 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, 1] [2025-03-09 00:29:09,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 00:29:09,607 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:09,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1331835646, now seen corresponding path program 1 times [2025-03-09 00:29:09,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:09,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541872353] [2025-03-09 00:29:09,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:09,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:09,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:29:09,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:29:09,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:09,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:10,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:10,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541872353] [2025-03-09 00:29:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541872353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:10,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 00:29:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221550251] [2025-03-09 00:29:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:10,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 00:29:10,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:10,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 00:29:10,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 00:29:10,522 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:10,779 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2025-03-09 00:29:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:29:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 58 [2025-03-09 00:29:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:10,780 INFO L225 Difference]: With dead ends: 151 [2025-03-09 00:29:10,780 INFO L226 Difference]: Without dead ends: 151 [2025-03-09 00:29:10,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-09 00:29:10,780 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 78 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:10,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 290 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:29:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-09 00:29:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2025-03-09 00:29:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 141 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2025-03-09 00:29:10,786 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 58 [2025-03-09 00:29:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:10,786 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2025-03-09 00:29:10,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2025-03-09 00:29:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 00:29:10,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:10,787 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, 1] [2025-03-09 00:29:10,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 00:29:10,787 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:10,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:10,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1667884510, now seen corresponding path program 1 times [2025-03-09 00:29:10,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:10,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101120842] [2025-03-09 00:29:10,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:10,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:10,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 00:29:10,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 00:29:10,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:10,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:10,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101120842] [2025-03-09 00:29:10,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101120842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333918064] [2025-03-09 00:29:10,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:10,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:10,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:29:11,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 00:29:11,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 00:29:11,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:11,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:11,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:29:11,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:11,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:11,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333918064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:11,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:11,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:29:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556816008] [2025-03-09 00:29:11,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:29:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:11,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:29:11,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:29:11,239 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:11,266 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2025-03-09 00:29:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-03-09 00:29:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:11,268 INFO L225 Difference]: With dead ends: 173 [2025-03-09 00:29:11,268 INFO L226 Difference]: Without dead ends: 173 [2025-03-09 00:29:11,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 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-03-09 00:29:11,269 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 259 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-03-09 00:29:11,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 259 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:29:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-09 00:29:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2025-03-09 00:29:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 165 states have internal predecessors, (189), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 191 transitions. [2025-03-09 00:29:11,277 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 191 transitions. Word has length 62 [2025-03-09 00:29:11,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:11,277 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 191 transitions. [2025-03-09 00:29:11,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 191 transitions. [2025-03-09 00:29:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 00:29:11,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:11,278 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, 1] [2025-03-09 00:29:11,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 00:29:11,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:11,479 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:11,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash 165058816, now seen corresponding path program 1 times [2025-03-09 00:29:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:11,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151252127] [2025-03-09 00:29:11,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:11,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:29:11,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:29:11,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:11,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:12,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151252127] [2025-03-09 00:29:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151252127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766723984] [2025-03-09 00:29:12,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:12,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:12,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:12,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:12,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:29:12,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:29:12,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:29:12,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:12,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:12,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 00:29:12,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:12,418 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-03-09 00:29:12,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:29:12,441 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-03-09 00:29:12,469 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-03-09 00:29:12,506 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 21 treesize of output 16 [2025-03-09 00:29:12,554 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:12,554 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-03-09 00:29:12,610 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:12,611 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-03-09 00:29:12,630 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-03-09 00:29:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 00:29:12,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:12,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2025-03-09 00:29:12,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1882) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) is different from false [2025-03-09 00:29:12,706 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-09 00:29:12,706 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 37 treesize of output 36 [2025-03-09 00:29:12,712 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem143#1.base| (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~mem143#1.base| v_ArrVal_1881))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1882)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) is different from false [2025-03-09 00:29:12,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1880)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_1881))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1882)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse3)))) is different from false [2025-03-09 00:29:12,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:29:12,773 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 127 treesize of output 80 [2025-03-09 00:29:12,778 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 2145 treesize of output 1537 [2025-03-09 00:29:12,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 144 treesize of output 102 [2025-03-09 00:29:12,792 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 48 treesize of output 30 [2025-03-09 00:29:12,796 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 84 treesize of output 66 [2025-03-09 00:29:12,862 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 00:29:12,863 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-03-09 00:29:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-03-09 00:29:12,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766723984] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:12,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:12,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2025-03-09 00:29:12,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864688007] [2025-03-09 00:29:12,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:12,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 00:29:12,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:12,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 00:29:12,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=244, Unknown=5, NotChecked=140, Total=462 [2025-03-09 00:29:12,872 INFO L87 Difference]: Start difference. First operand 168 states and 191 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:13,264 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2025-03-09 00:29:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:29:13,264 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 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 63 [2025-03-09 00:29:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:13,265 INFO L225 Difference]: With dead ends: 174 [2025-03-09 00:29:13,265 INFO L226 Difference]: Without dead ends: 174 [2025-03-09 00:29:13,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=353, Unknown=5, NotChecked=172, Total=650 [2025-03-09 00:29:13,267 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 79 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:13,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 577 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 405 Invalid, 0 Unknown, 359 Unchecked, 0.3s Time] [2025-03-09 00:29:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-09 00:29:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2025-03-09 00:29:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 141 states have (on average 1.297872340425532) internal successors, (183), 164 states have internal predecessors, (183), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2025-03-09 00:29:13,271 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 63 [2025-03-09 00:29:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:13,271 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2025-03-09 00:29:13,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2025-03-09 00:29:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 00:29:13,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:13,272 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, 1] [2025-03-09 00:29:13,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:29:13,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 00:29:13,473 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:13,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:13,473 INFO L85 PathProgramCache]: Analyzing trace with hash 165058817, now seen corresponding path program 1 times [2025-03-09 00:29:13,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:13,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129991571] [2025-03-09 00:29:13,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:13,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:29:13,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:29:13,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:13,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129991571] [2025-03-09 00:29:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129991571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149356197] [2025-03-09 00:29:14,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:14,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:14,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:14,526 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:14,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:29:14,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:29:14,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:29:14,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:14,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:14,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 00:29:14,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:14,817 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-03-09 00:29:14,829 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-03-09 00:29:14,837 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:29:14,837 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-03-09 00:29:14,870 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-03-09 00:29:14,875 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-03-09 00:29:14,925 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-03-09 00:29:14,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 20 treesize of output 15 [2025-03-09 00:29:15,000 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:15,000 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-03-09 00:29:15,005 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-03-09 00:29:15,095 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:15,096 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-03-09 00:29:15,106 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-03-09 00:29:15,156 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-03-09 00:29:15,162 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-03-09 00:29:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:15,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:15,334 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_2114 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2113 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2114) |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_2113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:29:15,353 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_2114 (Array Int Int)) (v_ArrVal_2113 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2114 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2025-03-09 00:29:15,366 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_2114 (Array Int Int)) (v_ArrVal_2113 (Array Int Int)) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2111 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2111))) (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~mem143#1.base| v_ArrVal_2112) .cse0 v_ArrVal_2114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2111 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2112) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2111) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2025-03-09 00:29:15,381 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_2114 (Array Int Int)) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2111 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2112) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2111) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2113 (Array Int Int)) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2111 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2111))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2112) .cse2 v_ArrVal_2114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-03-09 00:29:15,403 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_2109 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2113 (Array Int Int)) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2111 (Array Int Int)) (v_ArrVal_2110 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2110))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2111))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2109) .cse0 v_ArrVal_2112) .cse1 v_ArrVal_2114) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2113) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2114 (Array Int Int)) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2111 (Array Int Int)) (v_ArrVal_2110 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2110))) (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_2109) .cse5 v_ArrVal_2112) (select (select (store .cse6 .cse5 v_ArrVal_2111) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2114))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))))) is different from false [2025-03-09 00:29:15,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:29:15,441 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-03-09 00:29:15,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:29:15,452 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-03-09 00:29:15,459 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 852 treesize of output 716 [2025-03-09 00:29:15,476 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 2299 treesize of output 2195 [2025-03-09 00:29:15,499 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 655 treesize of output 559 [2025-03-09 00:29:15,506 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 559 treesize of output 535 [2025-03-09 00:29:15,514 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 535 treesize of output 511 [2025-03-09 00:29:15,524 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 511 treesize of output 463 [2025-03-09 00:29:15,529 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 463 treesize of output 391 [2025-03-09 00:29:15,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:29:15,632 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-03-09 00:29:15,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:29:15,640 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-03-09 00:29:15,643 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:29:15,646 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 1102 treesize of output 694 [2025-03-09 00:29:15,652 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:29:15,653 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:29:15,654 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-03-09 00:29:15,732 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 00:29:15,732 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-03-09 00:29:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2025-03-09 00:29:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149356197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:15,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:15,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2025-03-09 00:29:15,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119745978] [2025-03-09 00:29:15,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:15,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 00:29:15,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:15,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 00:29:15,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=596, Unknown=10, NotChecked=270, Total=992 [2025-03-09 00:29:15,741 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:20,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 00:29:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:21,186 INFO L93 Difference]: Finished difference Result 190 states and 207 transitions. [2025-03-09 00:29:21,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:29:21,187 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 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 63 [2025-03-09 00:29:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:21,188 INFO L225 Difference]: With dead ends: 190 [2025-03-09 00:29:21,188 INFO L226 Difference]: Without dead ends: 190 [2025-03-09 00:29:21,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=1465, Unknown=10, NotChecked=430, Total=2256 [2025-03-09 00:29:21,189 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 273 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 26 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 596 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:21,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 638 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 524 Invalid, 12 Unknown, 596 Unchecked, 4.8s Time] [2025-03-09 00:29:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-09 00:29:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2025-03-09 00:29:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 157 states have (on average 1.267515923566879) internal successors, (199), 180 states have internal predecessors, (199), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 201 transitions. [2025-03-09 00:29:21,193 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 201 transitions. Word has length 63 [2025-03-09 00:29:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:21,194 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 201 transitions. [2025-03-09 00:29:21,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 201 transitions. [2025-03-09 00:29:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 00:29:21,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:21,195 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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] [2025-03-09 00:29:21,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 00:29:21,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:21,396 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:21,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash 150617853, now seen corresponding path program 2 times [2025-03-09 00:29:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:21,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35630520] [2025-03-09 00:29:21,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:21,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:21,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:29:21,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:29:21,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:29:21,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35630520] [2025-03-09 00:29:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35630520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940864208] [2025-03-09 00:29:21,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:21,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:21,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:21,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:21,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:29:21,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:29:21,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:29:21,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:29:21,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:21,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:29:21,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:22,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940864208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:22,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:29:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860495401] [2025-03-09 00:29:22,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:22,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:29:22,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:22,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:29:22,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:29:22,139 INFO L87 Difference]: Start difference. First operand 183 states and 201 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:22,195 INFO L93 Difference]: Finished difference Result 236 states and 255 transitions. [2025-03-09 00:29:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:29:22,196 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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 77 [2025-03-09 00:29:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:22,197 INFO L225 Difference]: With dead ends: 236 [2025-03-09 00:29:22,197 INFO L226 Difference]: Without dead ends: 236 [2025-03-09 00:29:22,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:29:22,197 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 28 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:22,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 353 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:29:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-09 00:29:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 227. [2025-03-09 00:29:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 201 states have (on average 1.2587064676616915) internal successors, (253), 224 states have internal predecessors, (253), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 255 transitions. [2025-03-09 00:29:22,201 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 255 transitions. Word has length 77 [2025-03-09 00:29:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 255 transitions. [2025-03-09 00:29:22,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:29:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 255 transitions. [2025-03-09 00:29:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 00:29:22,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:22,202 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 5, 5, 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-03-09 00:29:22,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 00:29:22,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:22,403 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-03-09 00:29:22,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2056469057, now seen corresponding path program 2 times [2025-03-09 00:29:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:22,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938509943] [2025-03-09 00:29:22,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:22,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:22,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-09 00:29:22,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 00:29:22,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:29:22,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:24,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938509943] [2025-03-09 00:29:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938509943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72291333] [2025-03-09 00:29:24,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:29:24,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:24,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:24,151 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:29:24,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:29:24,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-09 00:29:24,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 00:29:24,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:29:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:24,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-09 00:29:24,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:24,479 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-03-09 00:29:24,499 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:29:24,499 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-03-09 00:29:24,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-03-09 00:29:24,543 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-03-09 00:29:24,547 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-03-09 00:29:24,600 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-03-09 00:29:24,603 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-03-09 00:29:24,669 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:24,670 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-03-09 00:29:24,677 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-03-09 00:29:24,801 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:24,802 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-03-09 00:29:24,811 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-03-09 00:29:24,929 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:24,930 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-03-09 00:29:24,940 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-03-09 00:29:25,073 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:25,074 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-03-09 00:29:25,082 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-03-09 00:29:25,186 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:25,186 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-03-09 00:29:25,192 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-03-09 00:29:25,298 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:29:25,298 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-03-09 00:29:25,309 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-03-09 00:29:25,358 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-03-09 00:29:25,363 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-03-09 00:29:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:29:25,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:25,493 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_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2661 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))))) is different from false [2025-03-09 00:29:25,511 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_2661 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:29:25,526 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_2661 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))) (forall ((v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:29:25,540 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_2659 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2660) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2659))) (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~mem144#1.base| v_ArrVal_2660) .cse1 v_ArrVal_2661) |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_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-03-09 00:29:25,559 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_2659 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2660) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2659))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2660) .cse2 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-03-09 00:29:25,579 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_2659 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2659))) (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_2660) .cse1 v_ArrVal_2661) |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_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2660) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3)))))) is different from false [2025-03-09 00:29:25,592 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_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2657))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2658) .cse0 v_ArrVal_2660) (select (select (store .cse1 .cse0 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2661))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2657))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2659))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2658) .cse3 v_ArrVal_2660) .cse4 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-03-09 00:29:25,754 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_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2657))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2658) .cse1 v_ArrVal_2660) (select (select (store .cse2 .cse1 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2661))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2657))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2659))) (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_2658) .cse4 v_ArrVal_2660) .cse5 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-03-09 00:29:25,787 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_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2655))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2657))) (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~mem144#1.base| v_ArrVal_2656) .cse0 v_ArrVal_2658) .cse1 v_ArrVal_2660) (select (select (store .cse2 .cse1 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2661))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2655))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2657))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2659))) (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~mem144#1.base| v_ArrVal_2656) .cse5 v_ArrVal_2658) .cse6 v_ArrVal_2660) .cse7 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-03-09 00:29:26,148 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|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2655))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2657))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2659))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2656) .cse1 v_ArrVal_2658) .cse2 v_ArrVal_2660) .cse3 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2655))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2657))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2656) .cse8 v_ArrVal_2658) .cse9 v_ArrVal_2660) (select (select (store .cse10 .cse9 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2661))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2025-03-09 00:29:31,169 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_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2653))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2655))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2657))) (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_#t~mem144#1.base| v_ArrVal_2654) .cse0 v_ArrVal_2656) .cse1 v_ArrVal_2658) .cse2 v_ArrVal_2660) (select (select (store .cse3 .cse2 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2661))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 5))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2653))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2655))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2657))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2659))) (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_#t~mem144#1.base| v_ArrVal_2654) .cse7 v_ArrVal_2656) .cse8 v_ArrVal_2658) .cse9 v_ArrVal_2660) .cse10 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 6) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))) is different from false [2025-03-09 00:29:35,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |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|) .cse5))) (and (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2653))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2655))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2657))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2659))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) .cse1 v_ArrVal_2656) .cse2 v_ArrVal_2658) .cse3 v_ArrVal_2660) .cse4 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 6) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2653))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_2655))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_2657))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) .cse10 v_ArrVal_2656) .cse11 v_ArrVal_2658) .cse12 v_ArrVal_2660) (select (select (store .cse13 .cse12 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_2661))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))) is different from false [2025-03-09 00:29:36,272 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |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|) .cse5))) (and (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2653))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2655))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2657))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2659))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) .cse1 v_ArrVal_2656) .cse2 v_ArrVal_2658) .cse3 v_ArrVal_2660) .cse4 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 6) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (Array Int Int)) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2654 (Array Int Int)) (v_ArrVal_2653 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ 5 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2653))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_2655))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_2657))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2654) .cse10 v_ArrVal_2656) .cse11 v_ArrVal_2658) .cse12 v_ArrVal_2660) (select (select (store .cse13 .cse12 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_2661))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))) is different from false [2025-03-09 00:29:41,697 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (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_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2652))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_2653))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2655))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2657))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2659))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2651) .cse0 v_ArrVal_2654) .cse1 v_ArrVal_2656) .cse2 v_ArrVal_2658) .cse3 v_ArrVal_2660) .cse4 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 6) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (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_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2652))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_2653))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_2655))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_2657))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2651) .cse11 v_ArrVal_2654) .cse12 v_ArrVal_2656) .cse13 v_ArrVal_2658) .cse14 v_ArrVal_2660) (select (select (store .cse15 .cse14 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_2661))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 5))))) is different from false [2025-03-09 00:29:45,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (* |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|) .cse6))) (and (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (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_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ 5 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2652))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2653))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2655))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_2657))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2651) .cse1 v_ArrVal_2654) .cse2 v_ArrVal_2656) .cse3 v_ArrVal_2658) .cse4 v_ArrVal_2660) (select (select (store .cse5 .cse4 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_2661))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))) (forall ((v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (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_2662 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2652))) (let ((.cse10 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse10 v_ArrVal_2653))) (let ((.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse11 v_ArrVal_2655))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_2657))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_2659))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (<= (+ 6 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2651) .cse10 v_ArrVal_2654) .cse11 v_ArrVal_2656) .cse12 v_ArrVal_2658) .cse13 v_ArrVal_2660) .cse14 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse15 .cse14 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))))))))))) is different from false [2025-03-09 00:29:50,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (* |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_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (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_2662 (Array Int Int)) (v_ArrVal_2650 (Array Int Int)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2650))) (let ((.cse0 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse0 v_ArrVal_2652))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_2653))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_2655))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_2657))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_2659))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (<= (+ (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2649) .cse0 v_ArrVal_2651) .cse1 v_ArrVal_2654) .cse2 v_ArrVal_2656) .cse3 v_ArrVal_2658) .cse4 v_ArrVal_2660) .cse5 v_ArrVal_2661) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) 6) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_2662) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))))))) (forall ((v_ArrVal_2649 (Array Int Int)) (v_ArrVal_2659 (Array Int Int)) (v_ArrVal_2658 (Array Int Int)) (v_ArrVal_2657 (Array Int Int)) (v_ArrVal_2656 (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)) (v_ArrVal_2661 (Array Int Int)) (v_ArrVal_2660 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2650))) (let ((.cse13 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse21 (store .cse22 .cse13 v_ArrVal_2652))) (let ((.cse14 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse20 (store .cse21 .cse14 v_ArrVal_2653))) (let ((.cse15 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse19 (store .cse20 .cse15 v_ArrVal_2655))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_2657))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2649) .cse13 v_ArrVal_2651) .cse14 v_ArrVal_2654) .cse15 v_ArrVal_2656) .cse16 v_ArrVal_2658) .cse17 v_ArrVal_2660) (select (select (store .cse18 .cse17 v_ArrVal_2659) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_2661))))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) 5))))) is different from false [2025-03-09 00:29:50,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:29:50,688 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 3329 treesize of output 3330 [2025-03-09 00:29:50,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:29:50,754 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 3317 treesize of output 1806