./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/yes-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/yes-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 8c3d0d99b1a4ed01b0f7abd82dc706f1d3a99a21ba3b1eb67aeb8a353cd5545e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:29:53,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:29:53,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-09 00:29:53,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:29:53,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:29:53,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:29:53,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:29:53,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:29:53,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:29:53,600 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:29:53,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:29:53,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:29:53,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:29:53,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:29:53,602 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:29:53,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:29:53,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:29:53,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:29:53,603 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:29:53,603 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:29:53,603 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:29:53,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:29:53,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:29:53,603 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:29:53,603 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:29:53,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:29:53,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:29:53,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:29:53,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:29:53,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:29:53,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:29:53,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:29:53,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:29:53,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:29:53,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:29:53,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:29:53,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:29:53,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:29:53,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:29:53,605 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 -> 8c3d0d99b1a4ed01b0f7abd82dc706f1d3a99a21ba3b1eb67aeb8a353cd5545e [2025-03-09 00:29:53,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:29:53,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:29:53,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:29:53,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:29:53,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:29:53,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/yes-2.i [2025-03-09 00:29:54,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc595925/28a6700ea44143b99630674718960716/FLAG4c193c3aa [2025-03-09 00:29:55,305 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:29:55,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/yes-2.i [2025-03-09 00:29:55,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc595925/28a6700ea44143b99630674718960716/FLAG4c193c3aa [2025-03-09 00:29:55,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc595925/28a6700ea44143b99630674718960716 [2025-03-09 00:29:55,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:29:55,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:29:55,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:29:55,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:29:55,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:29:55,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:29:55" (1/1) ... [2025-03-09 00:29:55,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e42fd9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:55, skipping insertion in model container [2025-03-09 00:29:55,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:29:55" (1/1) ... [2025-03-09 00:29:55,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:29:56,248 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:29:56,250 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:29:56,251 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:29:56,254 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:29:56,256 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:29:56,257 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:29:56,257 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:29:56,258 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:29:56,259 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:29:56,260 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:29:56,261 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:29:56,262 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:29:56,266 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:29:56,266 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:29: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:29:56,276 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:29:56,277 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:29:56,288 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:29:56,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:29:56,319 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:29:56,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:29:56,516 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 00:29:56,523 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:29:56,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56 WrapperNode [2025-03-09 00:29:56,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:29:56,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:29:56,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:29:56,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:29:56,530 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:29:56" (1/1) ... [2025-03-09 00:29:56,556 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:29:56" (1/1) ... [2025-03-09 00:29:56,594 INFO L138 Inliner]: procedures = 596, calls = 482, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 770 [2025-03-09 00:29:56,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:29:56,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:29:56,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:29:56,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:29:56,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,619 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 00:29:56,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:29:56,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:29:56,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:29:56,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:29:56,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (1/1) ... [2025-03-09 00:29:56,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:29:56,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:56,697 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:29:56,700 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:29:56,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:29:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 00:29:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 00:29:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 00:29:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:29:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:29:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 00:29:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:29:56,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:29:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 00:29:56,719 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 00:29:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 00:29:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 00:29:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 00:29:56,720 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 00:29:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:29:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 00:29:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 00:29:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 00:29:56,988 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:29:56,989 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:29:57,725 INFO L? ?]: Removed 338 outVars from TransFormulas that were not future-live. [2025-03-09 00:29:57,726 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:29:57,743 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:29:57,744 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:29:57,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:29:57 BoogieIcfgContainer [2025-03-09 00:29:57,746 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:29:57,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:29:57,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:29:57,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:29:57,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:29:55" (1/3) ... [2025-03-09 00:29:57,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410059a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:29:57, skipping insertion in model container [2025-03-09 00:29:57,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:29:56" (2/3) ... [2025-03-09 00:29:57,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410059a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:29:57, skipping insertion in model container [2025-03-09 00:29:57,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:29:57" (3/3) ... [2025-03-09 00:29:57,753 INFO L128 eAbstractionObserver]: Analyzing ICFG yes-2.i [2025-03-09 00:29:57,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:29:57,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG yes-2.i that has 3 procedures, 285 locations, 1 initial locations, 13 loop locations, and 116 error locations. [2025-03-09 00:29:57,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:29:57,812 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;@b9547ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:29:57,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 116 error locations. [2025-03-09 00:29:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 161 states have (on average 1.950310559006211) internal successors, (314), 277 states have internal predecessors, (314), 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:29:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:29:57,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:57,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:29:57,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:29:57,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:57,825 INFO L85 PathProgramCache]: Analyzing trace with hash 367377, now seen corresponding path program 1 times [2025-03-09 00:29:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907434573] [2025-03-09 00:29:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:58,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:29:58,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:29:58,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:58,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:58,388 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:29:58,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:58,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907434573] [2025-03-09 00:29:58,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907434573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:58,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:58,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:29:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898284180] [2025-03-09 00:29:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:29:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:58,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:29:58,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:58,412 INFO L87 Difference]: Start difference. First operand has 285 states, 161 states have (on average 1.950310559006211) internal successors, (314), 277 states have internal predecessors, (314), 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:29:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:58,488 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-03-09 00:29:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:58,490 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:29:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:58,495 INFO L225 Difference]: With dead ends: 62 [2025-03-09 00:29:58,495 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 00:29:58,496 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:58,499 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:58,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 00:29:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-09 00:29:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.8) internal successors, (63), 59 states have internal predecessors, (63), 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:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2025-03-09 00:29:58,528 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 3 [2025-03-09 00:29:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:58,528 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2025-03-09 00:29:58,528 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:29:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2025-03-09 00:29:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:29:58,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:58,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:29:58,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:29:58,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:29:58,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash 367378, now seen corresponding path program 1 times [2025-03-09 00:29:58,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:58,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399195466] [2025-03-09 00:29:58,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:58,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:58,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:29:58,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:29:58,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:58,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:58,817 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:29:58,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:58,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399195466] [2025-03-09 00:29:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399195466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:58,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:29:58,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933523036] [2025-03-09 00:29:58,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:58,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:29:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:58,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:29:58,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:58,820 INFO L87 Difference]: Start difference. First operand 62 states and 65 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:29:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:58,885 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-03-09 00:29:58,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:58,885 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:29:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:58,886 INFO L225 Difference]: With dead ends: 61 [2025-03-09 00:29:58,886 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 00:29:58,886 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:58,887 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:58,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:29:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 00:29:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-09 00:29:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 58 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:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-09 00:29:58,894 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 3 [2025-03-09 00:29:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:58,894 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-09 00:29:58,894 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:29:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-09 00:29:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:29:58,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:58,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:29:58,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:29:58,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:29:58,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:58,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1940071011, now seen corresponding path program 1 times [2025-03-09 00:29:58,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:58,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764459446] [2025-03-09 00:29:58,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:58,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:58,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:29:58,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:29:58,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:58,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:59,104 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:29:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764459446] [2025-03-09 00:29:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764459446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:59,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:29:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531690676] [2025-03-09 00:29:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:59,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:29:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:59,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:29:59,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:29:59,108 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:59,131 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2025-03-09 00:29:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:29:59,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 00:29:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:59,132 INFO L225 Difference]: With dead ends: 64 [2025-03-09 00:29:59,132 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 00:29:59,132 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:59,133 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 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:59,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 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:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 00:29:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-03-09 00:29:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.75) internal successors, (63), 59 states have internal predecessors, (63), 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:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2025-03-09 00:29:59,141 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 6 [2025-03-09 00:29:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:59,141 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2025-03-09 00:29:59,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2025-03-09 00:29:59,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 00:29:59,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:59,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 00:29:59,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:29:59,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:29:59,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:59,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1940070850, now seen corresponding path program 1 times [2025-03-09 00:29:59,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:59,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201069952] [2025-03-09 00:29:59,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:59,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 00:29:59,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 00:29:59,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:59,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:59,397 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:29:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201069952] [2025-03-09 00:29:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201069952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:29:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:29:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:29:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607128707] [2025-03-09 00:29:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:29:59,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:29:59,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:59,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:29:59,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:29:59,401 INFO L87 Difference]: Start difference. First operand 62 states and 65 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:29:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:59,485 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2025-03-09 00:29:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:29:59,485 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:29:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:59,486 INFO L225 Difference]: With dead ends: 64 [2025-03-09 00:29:59,486 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 00:29:59,486 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:29:59,486 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 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:59,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 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:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 00:29:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-03-09 00:29:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 60 states have internal predecessors, (64), 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:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2025-03-09 00:29:59,489 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 6 [2025-03-09 00:29:59,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:59,489 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2025-03-09 00:29:59,489 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:29:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2025-03-09 00:29:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:29:59,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:59,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:59,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:29:59,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:29:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:29:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash 724477996, now seen corresponding path program 1 times [2025-03-09 00:29:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:29:59,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79061138] [2025-03-09 00:29:59,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:29:59,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:29:59,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:29:59,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:59,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:59,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:29:59,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79061138] [2025-03-09 00:29:59,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79061138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:29:59,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555194139] [2025-03-09 00:29:59,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:29:59,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:29:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:29:59,635 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:59,636 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:59,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:29:59,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:29:59,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:29:59,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:29:59,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:29:59,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:29:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:59,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:29:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:29:59,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555194139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:29:59,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:29:59,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:29:59,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983102495] [2025-03-09 00:29:59,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:29:59,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:29:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:29:59,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:29:59,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:29:59,898 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:29:59,927 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2025-03-09 00:29:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:29:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 00:29:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:29:59,928 INFO L225 Difference]: With dead ends: 71 [2025-03-09 00:29:59,928 INFO L226 Difference]: Without dead ends: 71 [2025-03-09 00:29:59,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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:59,930 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:29:59,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:29:59,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-09 00:29:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-09 00:29:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 68 states have internal predecessors, (74), 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:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-03-09 00:29:59,934 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 9 [2025-03-09 00:29:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:29:59,934 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-03-09 00:29:59,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:29:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-03-09 00:29:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 00:29:59,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:29:59,934 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:29:59,943 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:30:00,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:00,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:00,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash 724478157, now seen corresponding path program 1 times [2025-03-09 00:30:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:00,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547448213] [2025-03-09 00:30:00,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:00,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:30:00,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:30:00,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:00,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:00,436 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:30:00,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:00,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547448213] [2025-03-09 00:30:00,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547448213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:00,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390033464] [2025-03-09 00:30:00,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:00,438 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:30:00,440 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:30:00,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:30:00,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:30:00,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:00,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:00,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:30:00,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:00,698 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:30:00,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:30:00,763 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:30:00,773 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:30:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390033464] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:30:00,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:30:00,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 00:30:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754475702] [2025-03-09 00:30:00,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:30:00,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 00:30:00,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:00,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 00:30:00,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-09 00:30:00,774 INFO L87 Difference]: Start difference. First operand 71 states and 76 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:30:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:00,932 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2025-03-09 00:30:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:30:00,933 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:30:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:00,933 INFO L225 Difference]: With dead ends: 70 [2025-03-09 00:30:00,933 INFO L226 Difference]: Without dead ends: 70 [2025-03-09 00:30:00,933 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:30:00,934 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:00,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 175 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-09 00:30:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-09 00:30:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 67 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:30:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2025-03-09 00:30:00,936 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 9 [2025-03-09 00:30:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:00,937 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2025-03-09 00:30:00,937 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:30:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2025-03-09 00:30:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:30:00,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:00,937 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:00,948 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:30:01,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 00:30:01,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:01,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash -992565027, now seen corresponding path program 2 times [2025-03-09 00:30:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:01,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878343193] [2025-03-09 00:30:01,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:30:01,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:01,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:30:01,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 00:30:01,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:30:01,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 00:30:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878343193] [2025-03-09 00:30:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878343193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:30:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147594360] [2025-03-09 00:30:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:01,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:30:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:01,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:30:01,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:30:01,367 INFO L87 Difference]: Start difference. First operand 70 states and 73 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:30:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:01,405 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2025-03-09 00:30:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:30:01,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 00:30:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:01,406 INFO L225 Difference]: With dead ends: 69 [2025-03-09 00:30:01,408 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 00:30:01,408 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:30:01,409 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:01,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 35 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 00:30:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-09 00:30:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 66 states have internal predecessors, (70), 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:30:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2025-03-09 00:30:01,411 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 18 [2025-03-09 00:30:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:01,411 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2025-03-09 00:30:01,411 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:30:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2025-03-09 00:30:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 00:30:01,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:01,412 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:01,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:30:01,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:01,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash -992565026, now seen corresponding path program 1 times [2025-03-09 00:30:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057926600] [2025-03-09 00:30:01,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:01,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:30:01,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:30:01,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:01,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:01,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:01,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057926600] [2025-03-09 00:30:01,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057926600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:01,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143273533] [2025-03-09 00:30:01,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:01,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:01,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:01,613 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:30:01,614 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:30:01,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:30:01,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:30:01,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:01,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:01,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:30:01,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:01,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:30:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:30:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143273533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:30:01,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:30:01,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:30:01,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707048271] [2025-03-09 00:30:01,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:30:01,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:30:01,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:01,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:30:01,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:30:01,907 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:01,947 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2025-03-09 00:30:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:30:01,948 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 00:30:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:01,948 INFO L225 Difference]: With dead ends: 87 [2025-03-09 00:30:01,948 INFO L226 Difference]: Without dead ends: 87 [2025-03-09 00:30:01,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:30:01,949 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:01,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-09 00:30:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-09 00:30:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 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:30:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-03-09 00:30:01,952 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 18 [2025-03-09 00:30:01,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:01,953 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-03-09 00:30:01,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:30:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-03-09 00:30:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 00:30:01,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:01,955 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:01,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:30:02,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:02,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:02,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:02,159 INFO L85 PathProgramCache]: Analyzing trace with hash 560690622, now seen corresponding path program 2 times [2025-03-09 00:30:02,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:02,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208739274] [2025-03-09 00:30:02,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:30:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:02,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:30:02,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-09 00:30:02,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 00:30:02,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:02,371 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:30:02,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:02,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208739274] [2025-03-09 00:30:02,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208739274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:02,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:02,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:30:02,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229111918] [2025-03-09 00:30:02,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:02,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:30:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:02,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:30:02,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:30:02,373 INFO L87 Difference]: Start difference. First operand 87 states and 90 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:30:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:02,438 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2025-03-09 00:30:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:30:02,439 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:30:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:02,439 INFO L225 Difference]: With dead ends: 86 [2025-03-09 00:30:02,439 INFO L226 Difference]: Without dead ends: 86 [2025-03-09 00:30:02,440 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:30:02,440 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:02,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 26 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:02,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-09 00:30:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-09 00:30:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.380952380952381) internal successors, (87), 83 states have internal predecessors, (87), 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:30:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-03-09 00:30:02,443 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 36 [2025-03-09 00:30:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:02,443 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-03-09 00:30:02,443 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:30:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-03-09 00:30:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:30:02,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:02,444 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:30:02,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:30:02,444 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:02,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash -427202674, now seen corresponding path program 1 times [2025-03-09 00:30:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588189556] [2025-03-09 00:30:02,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:02,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:02,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:30:02,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:30:02,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:02,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:02,691 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:30:02,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:02,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588189556] [2025-03-09 00:30:02,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588189556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:02,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:02,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:30:02,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241456545] [2025-03-09 00:30:02,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:02,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:30:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:02,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:30:02,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:02,693 INFO L87 Difference]: Start difference. First operand 86 states and 89 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:30:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:02,755 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-03-09 00:30:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:30:02,756 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:30:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:02,756 INFO L225 Difference]: With dead ends: 81 [2025-03-09 00:30:02,756 INFO L226 Difference]: Without dead ends: 81 [2025-03-09 00:30:02,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:30:02,757 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:02,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 44 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-09 00:30:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-09 00:30:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 78 states have internal predecessors, (82), 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:30:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-03-09 00:30:02,766 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 44 [2025-03-09 00:30:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:02,766 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-09 00:30:02,766 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:30:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-03-09 00:30:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 00:30:02,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:02,769 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:30:02,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:30:02,769 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:02,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash -427202673, now seen corresponding path program 1 times [2025-03-09 00:30:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:02,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998650412] [2025-03-09 00:30:02,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:02,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 00:30:02,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 00:30:02,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:02,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:03,404 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:30:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998650412] [2025-03-09 00:30:03,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998650412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:03,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:03,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:30:03,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982490486] [2025-03-09 00:30:03,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:03,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:30:03,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:03,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:30:03,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:30:03,405 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:30:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:03,457 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2025-03-09 00:30:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:30:03,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-09 00:30:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:03,458 INFO L225 Difference]: With dead ends: 92 [2025-03-09 00:30:03,458 INFO L226 Difference]: Without dead ends: 92 [2025-03-09 00:30:03,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:30:03,458 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 104 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:03,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 158 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-09 00:30:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2025-03-09 00:30:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 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:30:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-03-09 00:30:03,461 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 44 [2025-03-09 00:30:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:03,462 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-03-09 00:30:03,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 00:30:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-03-09 00:30:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:30:03,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:03,462 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:30:03,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:30:03,462 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:03,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash -806477071, now seen corresponding path program 1 times [2025-03-09 00:30:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:03,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669271152] [2025-03-09 00:30:03,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:03,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:03,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:30:03,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:30:03,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:03,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:03,746 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:30:03,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669271152] [2025-03-09 00:30:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669271152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:03,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:03,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:30:03,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389146575] [2025-03-09 00:30:03,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:03,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:30:03,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:03,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:30:03,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:30:03,749 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:30:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:03,812 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2025-03-09 00:30:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:30:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:30:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:03,813 INFO L225 Difference]: With dead ends: 83 [2025-03-09 00:30:03,814 INFO L226 Difference]: Without dead ends: 83 [2025-03-09 00:30:03,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:30:03,815 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 69 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:03,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 70 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-09 00:30:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-03-09 00:30:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 76 states have internal predecessors, (80), 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:30:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-03-09 00:30:03,819 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 47 [2025-03-09 00:30:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:03,819 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-03-09 00:30:03,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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:30:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-03-09 00:30:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:30:03,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:03,820 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:30:03,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:30:03,820 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash -806477072, now seen corresponding path program 1 times [2025-03-09 00:30:03,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:03,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521420768] [2025-03-09 00:30:03,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:03,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:03,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:30:03,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:30:03,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:03,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:04,012 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:30:04,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:04,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521420768] [2025-03-09 00:30:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521420768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:04,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:30:04,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754081491] [2025-03-09 00:30:04,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:04,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:30:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:04,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:30:04,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:30:04,016 INFO L87 Difference]: Start difference. First operand 79 states and 82 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:30:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:04,080 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-09 00:30:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:30:04,080 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:30:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:04,081 INFO L225 Difference]: With dead ends: 77 [2025-03-09 00:30:04,082 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 00:30:04,082 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:30:04,082 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:04,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 61 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 00:30:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 00:30:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 74 states have internal predecessors, (78), 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:30:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-03-09 00:30:04,090 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 47 [2025-03-09 00:30:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:04,090 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-03-09 00:30:04,090 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:30:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-03-09 00:30:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 00:30:04,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:04,091 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:30:04,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:30:04,091 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:04,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash -806476143, now seen corresponding path program 1 times [2025-03-09 00:30:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:04,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661601943] [2025-03-09 00:30:04,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:04,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 00:30:04,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 00:30:04,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:04,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:04,464 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:30:04,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:04,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661601943] [2025-03-09 00:30:04,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661601943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:04,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:04,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:30:04,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611497253] [2025-03-09 00:30:04,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:04,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:30:04,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:04,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:30:04,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:30:04,466 INFO L87 Difference]: Start difference. First operand 77 states and 80 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:30:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:04,577 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2025-03-09 00:30:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:30:04,577 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:30:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:04,578 INFO L225 Difference]: With dead ends: 96 [2025-03-09 00:30:04,578 INFO L226 Difference]: Without dead ends: 96 [2025-03-09 00:30:04,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:30:04,578 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 86 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:04,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 83 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:04,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-09 00:30:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2025-03-09 00:30:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 88 states have internal predecessors, (100), 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:30:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2025-03-09 00:30:04,581 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 47 [2025-03-09 00:30:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:04,582 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2025-03-09 00:30:04,582 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:30:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2025-03-09 00:30:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 00:30:04,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:04,582 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] [2025-03-09 00:30:04,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:30:04,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:04,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:04,583 INFO L85 PathProgramCache]: Analyzing trace with hash 769014798, now seen corresponding path program 1 times [2025-03-09 00:30:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:04,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635950878] [2025-03-09 00:30:04,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:04,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 00:30:04,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 00:30:04,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:04,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:04,831 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:30:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:04,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635950878] [2025-03-09 00:30:04,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635950878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:04,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:04,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:30:04,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881507911] [2025-03-09 00:30:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:04,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:30:04,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:04,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:30:04,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:30:04,832 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:30:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:04,877 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2025-03-09 00:30:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:30:04,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 48 [2025-03-09 00:30:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:04,878 INFO L225 Difference]: With dead ends: 96 [2025-03-09 00:30:04,878 INFO L226 Difference]: Without dead ends: 96 [2025-03-09 00:30:04,878 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:30:04,879 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 74 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:04,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 144 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:04,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-09 00:30:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2025-03-09 00:30:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 88 states have internal predecessors, (99), 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:30:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2025-03-09 00:30:04,883 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 48 [2025-03-09 00:30:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:04,883 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2025-03-09 00:30:04,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:30:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2025-03-09 00:30:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:30:04,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:04,883 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:30:04,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:30:04,884 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:04,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:04,884 INFO L85 PathProgramCache]: Analyzing trace with hash 316529833, now seen corresponding path program 1 times [2025-03-09 00:30:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:04,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584309239] [2025-03-09 00:30:04,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:04,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:04,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:30:04,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:30:04,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:04,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:05,115 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:30:05,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584309239] [2025-03-09 00:30:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584309239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:05,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:30:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139820256] [2025-03-09 00:30:05,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:05,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:30:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:05,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:30:05,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:05,116 INFO L87 Difference]: Start difference. First operand 91 states and 101 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:30:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:05,152 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2025-03-09 00:30:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:30:05,153 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:30:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:05,153 INFO L225 Difference]: With dead ends: 90 [2025-03-09 00:30:05,153 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 00:30:05,153 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:30:05,154 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:05,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 00:30:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-09 00:30:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 87 states have internal predecessors, (97), 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:30:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-03-09 00:30:05,157 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 50 [2025-03-09 00:30:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:05,158 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-03-09 00:30:05,158 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:30:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-03-09 00:30:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:30:05,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:05,160 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:30:05,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:30:05,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:05,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:05,161 INFO L85 PathProgramCache]: Analyzing trace with hash 316529834, now seen corresponding path program 1 times [2025-03-09 00:30:05,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:05,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048079183] [2025-03-09 00:30:05,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:05,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:05,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:30:05,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:30:05,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:05,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:05,695 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:30:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048079183] [2025-03-09 00:30:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048079183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:05,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:30:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345831037] [2025-03-09 00:30:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:05,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:30:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:05,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:30:05,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:30:05,697 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:30:05,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:05,877 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-03-09 00:30:05,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:30:05,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:30:05,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:05,878 INFO L225 Difference]: With dead ends: 94 [2025-03-09 00:30:05,878 INFO L226 Difference]: Without dead ends: 94 [2025-03-09 00:30:05,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:30:05,878 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:05,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 98 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-09 00:30:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-09 00:30:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 87 states have internal predecessors, (96), 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:30:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-03-09 00:30:05,880 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 50 [2025-03-09 00:30:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:05,881 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-03-09 00:30:05,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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:30:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-03-09 00:30:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:30:05,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:05,881 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:30:05,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:30:05,882 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 113 more)] === [2025-03-09 00:30:05,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2007652151, now seen corresponding path program 1 times [2025-03-09 00:30:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430261165] [2025-03-09 00:30:05,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:05,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:30:05,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:30:05,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:05,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:06,253 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:30:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:06,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430261165] [2025-03-09 00:30:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430261165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:06,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:30:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403942890] [2025-03-09 00:30:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:06,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:30:06,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:06,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:30:06,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:30:06,255 INFO L87 Difference]: Start difference. First operand 90 states and 98 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:30:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:06,346 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2025-03-09 00:30:06,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:30:06,346 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:30:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:06,347 INFO L225 Difference]: With dead ends: 89 [2025-03-09 00:30:06,347 INFO L226 Difference]: Without dead ends: 89 [2025-03-09 00:30:06,347 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:30:06,347 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:06,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 119 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:06,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-09 00:30:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-09 00:30:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 86 states have internal predecessors, (94), 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:30:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2025-03-09 00:30:06,350 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 53 [2025-03-09 00:30:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:06,350 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2025-03-09 00:30:06,350 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:30:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2025-03-09 00:30:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:30:06,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:06,351 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:30:06,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 00:30:06,351 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:06,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2007652150, now seen corresponding path program 1 times [2025-03-09 00:30:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:06,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638699130] [2025-03-09 00:30:06,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:06,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:30:06,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:30:06,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:06,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:06,905 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:30:06,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:06,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638699130] [2025-03-09 00:30:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638699130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 00:30:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658659470] [2025-03-09 00:30:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:06,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:30:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:06,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:30:06,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:30:06,907 INFO L87 Difference]: Start difference. First operand 89 states and 96 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:30:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:06,996 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2025-03-09 00:30:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:30:06,996 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:30:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:06,997 INFO L225 Difference]: With dead ends: 88 [2025-03-09 00:30:06,997 INFO L226 Difference]: Without dead ends: 88 [2025-03-09 00:30:06,997 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:30:06,998 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:06,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 116 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-09 00:30:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-09 00:30:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 85 states have internal predecessors, (92), 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:30:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-03-09 00:30:07,002 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 53 [2025-03-09 00:30:07,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:07,002 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-03-09 00:30:07,002 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:30:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-03-09 00:30:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 00:30:07,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:07,004 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:30:07,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 00:30:07,004 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:07,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:07,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1596928899, now seen corresponding path program 1 times [2025-03-09 00:30:07,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:07,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002778824] [2025-03-09 00:30:07,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:07,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:07,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 00:30:07,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 00:30:07,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:07,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:07,142 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:30:07,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:07,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002778824] [2025-03-09 00:30:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002778824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:30:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112433245] [2025-03-09 00:30:07,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:07,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:30:07,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:07,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:30:07,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:30:07,144 INFO L87 Difference]: Start difference. First operand 88 states and 94 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:30:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:07,157 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2025-03-09 00:30:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:30:07,157 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:30:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:07,159 INFO L225 Difference]: With dead ends: 100 [2025-03-09 00:30:07,159 INFO L226 Difference]: Without dead ends: 100 [2025-03-09 00:30:07,159 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:30:07,160 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 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:30:07,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-09 00:30:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-03-09 00:30:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 87 states have internal predecessors, (94), 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:30:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2025-03-09 00:30:07,163 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 57 [2025-03-09 00:30:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:07,163 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2025-03-09 00:30:07,163 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:30:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2025-03-09 00:30:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:30:07,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:07,164 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:30:07,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 00:30:07,164 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:07,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2035058271, now seen corresponding path program 1 times [2025-03-09 00:30:07,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:07,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811193425] [2025-03-09 00:30:07,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:07,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:30:07,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:30:07,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:07,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:07,690 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:30:07,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:07,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811193425] [2025-03-09 00:30:07,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811193425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:07,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:07,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 00:30:07,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173811889] [2025-03-09 00:30:07,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:07,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:30:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:07,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:30:07,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:30:07,693 INFO L87 Difference]: Start difference. First operand 90 states and 96 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:30:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:07,833 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-03-09 00:30:07,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:30:07,834 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:30:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:07,835 INFO L225 Difference]: With dead ends: 97 [2025-03-09 00:30:07,835 INFO L226 Difference]: Without dead ends: 97 [2025-03-09 00:30:07,835 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:30:07,836 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:07,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 125 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:30:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-09 00:30:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-09 00:30:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 93 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:30:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-03-09 00:30:07,839 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 58 [2025-03-09 00:30:07,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:07,840 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-03-09 00:30:07,840 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:30:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-03-09 00:30:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:30:07,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:07,841 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:30:07,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 00:30:07,841 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:07,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2035058272, now seen corresponding path program 1 times [2025-03-09 00:30:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342011268] [2025-03-09 00:30:07,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:07,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:30:07,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:30:07,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:07,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:08,838 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:30:08,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:08,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342011268] [2025-03-09 00:30:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342011268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:30:08,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:30:08,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 00:30:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106188120] [2025-03-09 00:30:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:30:08,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:30:08,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:08,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:30:08,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:30:08,840 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 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:30:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:09,088 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2025-03-09 00:30:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:30:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 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:30:09,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:09,090 INFO L225 Difference]: With dead ends: 98 [2025-03-09 00:30:09,090 INFO L226 Difference]: Without dead ends: 98 [2025-03-09 00:30:09,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:30:09,095 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 101 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:09,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 163 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 00:30:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-09 00:30:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-03-09 00:30:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.2) internal successors, (102), 93 states have internal predecessors, (102), 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:30:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2025-03-09 00:30:09,098 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 58 [2025-03-09 00:30:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:09,098 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2025-03-09 00:30:09,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 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:30:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2025-03-09 00:30:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 00:30:09,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:09,099 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:30:09,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 00:30:09,099 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:09,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1498339260, now seen corresponding path program 1 times [2025-03-09 00:30:09,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:09,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084233809] [2025-03-09 00:30:09,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:09,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 00:30:09,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 00:30:09,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:09,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:09,216 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:30:09,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084233809] [2025-03-09 00:30:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084233809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:09,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850362753] [2025-03-09 00:30:09,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:09,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:09,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:09,219 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:30:09,220 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:30:09,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 00:30:09,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 00:30:09,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:09,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:09,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:30:09,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:30:09,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:30:09,573 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:30:09,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850362753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:30:09,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:30:09,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:30:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540654126] [2025-03-09 00:30:09,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:30:09,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:30:09,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:09,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:30:09,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:30:09,579 INFO L87 Difference]: Start difference. First operand 96 states and 104 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:30:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:09,604 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2025-03-09 00:30:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:30:09,605 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:30:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:09,606 INFO L225 Difference]: With dead ends: 125 [2025-03-09 00:30:09,606 INFO L226 Difference]: Without dead ends: 125 [2025-03-09 00:30:09,606 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:30:09,606 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:09,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 171 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-09 00:30:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2025-03-09 00:30:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 117 states have internal predecessors, (136), 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:30:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2025-03-09 00:30:09,610 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 62 [2025-03-09 00:30:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:09,611 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2025-03-09 00:30:09,611 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:30:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2025-03-09 00:30:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 00:30:09,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:09,612 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:30:09,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 00:30:09,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:09,813 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:09,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash -795876608, now seen corresponding path program 1 times [2025-03-09 00:30:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:09,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834536272] [2025-03-09 00:30:09,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:09,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:30:09,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:30:09,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:09,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:10,377 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:30:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834536272] [2025-03-09 00:30:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834536272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:10,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325074154] [2025-03-09 00:30:10,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:10,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:10,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:10,380 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:30:10,382 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:30:10,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:30:10,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:30:10,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:10,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:10,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 00:30:10,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:10,695 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:30:10,725 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 00:30:10,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-09 00:30:10,755 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:30:10,797 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:30:10,873 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:30:10,873 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:30:10,947 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:30:10,947 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:30:10,969 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:30:11,038 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:30:11,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:30:11,103 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2667 (Array Int Int))) (= (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_2667) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2025-03-09 00:30:11,116 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2666))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2667)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-09 00:30:15,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:30:15,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-03-09 00:30:15,243 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 2862 treesize of output 2230 [2025-03-09 00:30:15,273 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 228 treesize of output 216 [2025-03-09 00:30:15,280 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 125 treesize of output 89 [2025-03-09 00:30:15,284 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 180 treesize of output 120 [2025-03-09 00:30:15,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:30:15,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2025-03-09 00:30:16,132 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:30:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325074154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:30:16,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:30:16,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2025-03-09 00:30:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432340975] [2025-03-09 00:30:16,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:30:16,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 00:30:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:16,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 00:30:16,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=351, Unknown=27, NotChecked=82, Total=552 [2025-03-09 00:30:16,134 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 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:30:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:16,416 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2025-03-09 00:30:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:30:16,417 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 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:30:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:16,418 INFO L225 Difference]: With dead ends: 119 [2025-03-09 00:30:16,418 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 00:30:16,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=123, Invalid=409, Unknown=28, NotChecked=90, Total=650 [2025-03-09 00:30:16,419 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 44 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:16,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 240 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 227 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2025-03-09 00:30:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 00:30:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 00:30:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 116 states have internal predecessors, (130), 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:30:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2025-03-09 00:30:16,423 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 63 [2025-03-09 00:30:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:16,423 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2025-03-09 00:30:16,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 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:30:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2025-03-09 00:30:16,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 00:30:16,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:16,424 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:30:16,434 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:30:16,624 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,SelfDestructingSolverStorable23 [2025-03-09 00:30:16,625 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash -795876607, now seen corresponding path program 1 times [2025-03-09 00:30:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:16,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529613614] [2025-03-09 00:30:16,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:16,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:16,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:30:16,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:30:16,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:16,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:17,674 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:30:17,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:17,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529613614] [2025-03-09 00:30:17,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529613614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:17,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077740015] [2025-03-09 00:30:17,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:30:17,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:17,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:17,677 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:30:17,679 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:30:17,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 00:30:18,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 00:30:18,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:30:18,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:18,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-09 00:30:18,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:18,027 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:30:18,048 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:30:18,048 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:30:18,054 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:30:18,081 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 23 treesize of output 1 [2025-03-09 00:30:18,085 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:30:18,135 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:30:18,142 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:30:18,201 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:30:18,201 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:30:18,216 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:30:18,307 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:30:18,307 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:30:18,314 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 49 treesize of output 26 [2025-03-09 00:30:18,412 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:30:18,420 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 36 treesize of output 12 [2025-03-09 00:30:18,452 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:30:18,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:30:18,911 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_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2948))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2947) .cse3 v_ArrVal_2949))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (forall ((v_ArrVal_2951 (Array Int Int))) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2950) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2951) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (< .cse0 0))))))) (forall ((v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2948))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2947) .cse9 v_ArrVal_2949))) (or (forall ((v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int))) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_2950))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_2951) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_2952) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))) (< (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 0)))))))) is different from false [2025-03-09 00:30:18,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:30:18,955 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 471 treesize of output 424 [2025-03-09 00:30:18,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:30:18,963 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 411 treesize of output 268 [2025-03-09 00:30:18,973 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 19478 treesize of output 15982 [2025-03-09 00:30:19,079 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 48351 treesize of output 46487 [2025-03-09 00:30:19,240 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 3925 treesize of output 3637 [2025-03-09 00:30:19,262 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 3637 treesize of output 3433 [2025-03-09 00:30:19,290 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 3433 treesize of output 2761 [2025-03-09 00:30:19,309 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 2761 treesize of output 2569 [2025-03-09 00:30:19,327 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 2569 treesize of output 2185 [2025-03-09 00:30:19,346 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 2185 treesize of output 2083 [2025-03-09 00:30:19,364 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 2083 treesize of output 2065 [2025-03-09 00:30:19,384 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 2065 treesize of output 2053 [2025-03-09 00:30:19,402 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 2053 treesize of output 2029 [2025-03-09 00:30:19,419 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 2029 treesize of output 2017 [2025-03-09 00:30:19,438 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 2017 treesize of output 2011 [2025-03-09 00:30:31,519 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 00:30:31,519 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:30:31,524 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:30:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077740015] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:30:31,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:30:31,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2025-03-09 00:30:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085684404] [2025-03-09 00:30:31,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:30:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 00:30:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:31,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 00:30:31,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=848, Unknown=8, NotChecked=60, Total=1056 [2025-03-09 00:30:31,527 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 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:30:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:32,522 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2025-03-09 00:30:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 00:30:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 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:30:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:32,525 INFO L225 Difference]: With dead ends: 125 [2025-03-09 00:30:32,525 INFO L226 Difference]: Without dead ends: 125 [2025-03-09 00:30:32,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=330, Invalid=1558, Unknown=8, NotChecked=84, Total=1980 [2025-03-09 00:30:32,526 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 86 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 13 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:30:32,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 352 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 532 Invalid, 10 Unknown, 58 Unchecked, 0.5s Time] [2025-03-09 00:30:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-09 00:30:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-09 00:30:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 122 states have internal predecessors, (132), 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:30:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2025-03-09 00:30:32,534 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 63 [2025-03-09 00:30:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:32,534 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2025-03-09 00:30:32,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 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:30:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2025-03-09 00:30:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 00:30:32,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:32,535 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:30:32,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:30:32,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:32,740 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash -561679555, now seen corresponding path program 2 times [2025-03-09 00:30:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:32,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979952313] [2025-03-09 00:30:32,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:30:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:32,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:30:32,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:30:32,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:30:32,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:32,992 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:30:32,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:32,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979952313] [2025-03-09 00:30:32,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979952313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:32,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097100272] [2025-03-09 00:30:32,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:30:32,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:32,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:32,995 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:30:32,996 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:30:33,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-09 00:30:33,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 00:30:33,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:30:33,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:33,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:30:33,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:33,402 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:30:33,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:30:33,452 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:30:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097100272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:30:33,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:30:33,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:30:33,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642442565] [2025-03-09 00:30:33,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:30:33,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:30:33,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:30:33,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:30:33,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:30:33,454 INFO L87 Difference]: Start difference. First operand 125 states and 134 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:30:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:30:33,486 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2025-03-09 00:30:33,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:30:33,487 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:30:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:30:33,488 INFO L225 Difference]: With dead ends: 188 [2025-03-09 00:30:33,488 INFO L226 Difference]: Without dead ends: 188 [2025-03-09 00:30:33,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:30:33,488 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 30 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 185 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:30:33,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 185 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:30:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-09 00:30:33,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2025-03-09 00:30:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 169 states have (on average 1.1893491124260356) internal successors, (201), 176 states have internal predecessors, (201), 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:30:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 203 transitions. [2025-03-09 00:30:33,497 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 203 transitions. Word has length 77 [2025-03-09 00:30:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:30:33,498 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 203 transitions. [2025-03-09 00:30:33,498 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:30:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 203 transitions. [2025-03-09 00:30:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 00:30:33,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:30:33,498 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 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:30:33,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:30:33,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:33,699 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-09 00:30:33,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:30:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash -231950432, now seen corresponding path program 2 times [2025-03-09 00:30:33,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:30:33,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218343141] [2025-03-09 00:30:33,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:30:33,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:30:33,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-09 00:30:33,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 00:30:33,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:30:33,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:30:35,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:30:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218343141] [2025-03-09 00:30:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218343141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:30:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711308574] [2025-03-09 00:30:35,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:30:35,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:30:35,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:30:35,273 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:30:35,286 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:30:35,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-09 00:30:35,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 00:30:35,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:30:35,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:30:35,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-09 00:30:35,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:30:35,864 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:30:35,875 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:30:35,883 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 00:30:35,883 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:30:35,911 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:30:35,914 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:30:35,965 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:30:35,971 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:30:36,021 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:30:36,021 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:30:36,026 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:30:36,108 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:30:36,108 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:30:36,116 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:30:36,207 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:30:36,207 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:30:36,212 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:30:36,282 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:30:36,283 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:30:36,288 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:30:36,361 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 00:30:36,361 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:30:36,367 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:30:36,414 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:30:36,418 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:30:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 00:30:36,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:30:36,637 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_3593 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-03-09 00:30:36,647 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_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3591) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3590))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3591) .cse1 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-03-09 00:30:36,662 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_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3590))) (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_3591) .cse1 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3591) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 2)))))) is different from false [2025-03-09 00:30:36,678 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_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3591) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3590))) (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_3591) .cse2 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-03-09 00:30:36,699 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_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3588))) (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~mem159#1.base| v_ArrVal_3589) .cse0 v_ArrVal_3591) (select (select (store .cse1 .cse0 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_3593))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3588))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_3590))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3589) .cse3 v_ArrVal_3591) .cse4 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-03-09 00:30:36,731 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_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3588))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3589) .cse1 v_ArrVal_3591) (select (select (store .cse2 .cse1 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_3593))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 3))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3588))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_3590))) (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_3589) .cse4 v_ArrVal_3591) .cse5 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-03-09 00:30:36,756 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_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3588))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_3590))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3589) .cse1 v_ArrVal_3591) .cse2 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3588))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3589) .cse6 v_ArrVal_3591) (select (select (store .cse7 .cse6 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_3593))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2025-03-09 00:30:36,772 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_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3586))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3588))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_3590))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3587) .cse0 v_ArrVal_3589) .cse1 v_ArrVal_3591) .cse2 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 5) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3586))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3588))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem159#1.base| v_ArrVal_3587) .cse7 v_ArrVal_3589) .cse8 v_ArrVal_3591) (select (select (store .cse9 .cse8 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_3593))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4))))) is different from false [2025-03-09 00:30:36,798 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_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3586))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3588))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_3590))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3587) .cse1 v_ArrVal_3589) .cse2 v_ArrVal_3591) .cse3 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3586))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_3588))) (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_3587) .cse8 v_ArrVal_3589) .cse9 v_ArrVal_3591) (select (select (store .cse10 .cse9 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_3593))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4)))))) is different from false [2025-03-09 00:30:36,823 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_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3586))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3588))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_3590))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ 5 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3587) .cse1 v_ArrVal_3589) .cse2 v_ArrVal_3591) .cse3 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3586))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_3588))) (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_3587) .cse8 v_ArrVal_3589) .cse9 v_ArrVal_3591) (select (select (store .cse10 .cse9 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_3593))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4)))))) is different from false [2025-03-09 00:30:36,852 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_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3584 (Array Int Int)) (v_ArrVal_3585 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_3584))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3586))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3588))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_3590))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ 5 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_3585) .cse0 v_ArrVal_3587) .cse1 v_ArrVal_3589) .cse2 v_ArrVal_3591) .cse3 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3584 (Array Int Int)) (v_ArrVal_3585 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ 4 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_3584))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3586))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3588))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_3585) .cse9 v_ArrVal_3587) .cse10 v_ArrVal_3589) .cse11 v_ArrVal_3591) (select (select (store .cse12 .cse11 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_3593))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))) is different from false [2025-03-09 00:30:36,888 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_3591 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3584 (Array Int Int)) (v_ArrVal_3585 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3584))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3586))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3588))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3585) .cse1 v_ArrVal_3587) .cse2 v_ArrVal_3589) .cse3 v_ArrVal_3591) (select (select (store .cse4 .cse3 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_3593))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 4))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3584 (Array Int Int)) (v_ArrVal_3585 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3584))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_3586))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_3588))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_3590))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ 5 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3585) .cse8 v_ArrVal_3587) .cse9 v_ArrVal_3589) .cse10 v_ArrVal_3591) .cse11 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))))))) is different from false [2025-03-09 00:30:36,983 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_3591 (Array Int Int)) (v_ArrVal_3582 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3583 (Array Int Int)) (v_ArrVal_3584 (Array Int Int)) (v_ArrVal_3585 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3582))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_3584))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_3586))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_3588))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3583) .cse0 v_ArrVal_3585) .cse1 v_ArrVal_3587) .cse2 v_ArrVal_3589) .cse3 v_ArrVal_3591) (select (select (store .cse4 .cse3 v_ArrVal_3590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_3593))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 4))) (forall ((v_ArrVal_3591 (Array Int Int)) (v_ArrVal_3592 (Array Int Int)) (v_ArrVal_3582 (Array Int Int)) (v_ArrVal_3593 (Array Int Int)) (v_ArrVal_3583 (Array Int Int)) (v_ArrVal_3584 (Array Int Int)) (v_ArrVal_3585 (Array Int Int)) (v_ArrVal_3586 (Array Int Int)) (v_ArrVal_3587 (Array Int Int)) (v_ArrVal_3588 (Array Int Int)) (v_ArrVal_3589 (Array Int Int)) (v_ArrVal_3590 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3582))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_3584))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_3586))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_3588))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_3590))) (let ((.cse13 (select (select .cse14 |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_~mem_track~0#1.base| v_ArrVal_3583) .cse9 v_ArrVal_3585) .cse10 v_ArrVal_3587) .cse11 v_ArrVal_3589) .cse12 v_ArrVal_3591) .cse13 v_ArrVal_3593) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 5) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_3592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))))))) is different from false [2025-03-09 00:30:37,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:30:37,014 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 834 treesize of output 835 [2025-03-09 00:30:37,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:30:37,019 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 822 treesize of output 463 [2025-03-09 00:30:37,113 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 61700830 treesize of output 51435958 [2025-03-09 00:30:41,648 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 11170428 treesize of output 11120492 [2025-03-09 00:30:41,950 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 1030 treesize of output 994 [2025-03-09 00:30:41,957 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 994 treesize of output 970 [2025-03-09 00:30:41,964 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 970 treesize of output 874 [2025-03-09 00:30:41,975 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 874 treesize of output 766 [2025-03-09 00:30:41,980 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 766 treesize of output 646 [2025-03-09 00:30:41,985 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 646 treesize of output 526 [2025-03-09 00:30:41,990 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 526 treesize of output 502 [2025-03-09 00:30:41,996 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 502 treesize of output 490 [2025-03-09 00:30:42,000 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 490 treesize of output 478 [2025-03-09 00:30:42,008 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 247 treesize of output 235 [2025-03-09 00:30:42,015 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 235 treesize of output 229 [2025-03-09 00:30:42,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:30:42,116 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 1665 treesize of output 1666 [2025-03-09 00:30:42,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:30:42,123 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 1653 treesize of output 910 [2025-03-09 00:30:42,125 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:30:42,207 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 1177651454 treesize of output 937331782