./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/sync-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/sync-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3e9a9e28ec707ec387b70e5fb29d6b347c7ed8919bb4c21e62aca8b2b5a70bf5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:08:47,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:08:47,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-10 00:08:47,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:08:47,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:08:47,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:08:47,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:08:47,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:08:47,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:08:47,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:08:47,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:08:47,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:08:47,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:08:47,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:08:47,147 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:08:47,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:08:47,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:08:47,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:08:47,149 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:08:47,149 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:08:47,149 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:08:47,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:08:47,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:08:47,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:08:47,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:08:47,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:08:47,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:08:47,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:08:47,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:08:47,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:08:47,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:08:47,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:08:47,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:08:47,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e9a9e28ec707ec387b70e5fb29d6b347c7ed8919bb4c21e62aca8b2b5a70bf5 [2025-01-10 00:08:47,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:08:47,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:08:47,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:08:47,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:08:47,458 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:08:47,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/sync-2.i [2025-01-10 00:08:48,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16c253a66/5bf64400ca1245a78a062717debd708d/FLAGfc4e1c838 [2025-01-10 00:08:49,226 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:08:49,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/sync-2.i [2025-01-10 00:08:49,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16c253a66/5bf64400ca1245a78a062717debd708d/FLAGfc4e1c838 [2025-01-10 00:08:49,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16c253a66/5bf64400ca1245a78a062717debd708d [2025-01-10 00:08:49,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:08:49,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:08:49,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:08:49,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:08:49,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:08:49,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:08:49" (1/1) ... [2025-01-10 00:08:49,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8842ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:49, skipping insertion in model container [2025-01-10 00:08:49,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:08:49" (1/1) ... [2025-01-10 00:08:49,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:08:50,139 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,144 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,149 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,152 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,153 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,155 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,156 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,157 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,158 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,160 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,162 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,163 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,168 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,169 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,178 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,194 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:08:50,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:08:50,244 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:08:50,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:08:50,507 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 00:08:50,514 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:08:50,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50 WrapperNode [2025-01-10 00:08:50,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:08:50,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:08:50,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:08:50,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:08:50,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,623 INFO L138 Inliner]: procedures = 540, calls = 474, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 702 [2025-01-10 00:08:50,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:08:50,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:08:50,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:08:50,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:08:50,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,672 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 00:08:50,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:08:50,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:08:50,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:08:50,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:08:50,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (1/1) ... [2025-01-10 00:08:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:08:50,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:50,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:08:50,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:08:50,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:08:50,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 00:08:50,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 00:08:50,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 00:08:50,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:08:50,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:08:50,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 00:08:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:08:50,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:08:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 00:08:50,827 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 00:08:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 00:08:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 00:08:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:08:50,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:08:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:08:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 00:08:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 00:08:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 00:08:51,149 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:08:51,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:08:52,214 INFO L? ?]: Removed 329 outVars from TransFormulas that were not future-live. [2025-01-10 00:08:52,215 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:08:52,236 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:08:52,238 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 00:08:52,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:08:52 BoogieIcfgContainer [2025-01-10 00:08:52,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:08:52,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:08:52,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:08:52,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:08:52,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:08:49" (1/3) ... [2025-01-10 00:08:52,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd83ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:08:52, skipping insertion in model container [2025-01-10 00:08:52,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:08:50" (2/3) ... [2025-01-10 00:08:52,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd83ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:08:52, skipping insertion in model container [2025-01-10 00:08:52,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:08:52" (3/3) ... [2025-01-10 00:08:52,250 INFO L128 eAbstractionObserver]: Analyzing ICFG sync-2.i [2025-01-10 00:08:52,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:08:52,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sync-2.i that has 3 procedures, 263 locations, 1 initial locations, 11 loop locations, and 107 error locations. [2025-01-10 00:08:52,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:08:52,331 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;@16c684c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:08:52,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 107 error locations. [2025-01-10 00:08:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 148 states have (on average 1.9256756756756757) internal successors, (285), 255 states have internal predecessors, (285), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 00:08:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:08:52,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:52,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:08:52,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:52,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash 62626, now seen corresponding path program 1 times [2025-01-10 00:08:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401124855] [2025-01-10 00:08:52,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:52,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:08:52,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:08:52,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:52,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401124855] [2025-01-10 00:08:52,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401124855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:52,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:52,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:52,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786345788] [2025-01-10 00:08:52,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:52,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:52,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:52,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:52,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:52,976 INFO L87 Difference]: Start difference. First operand has 263 states, 148 states have (on average 1.9256756756756757) internal successors, (285), 255 states have internal predecessors, (285), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:53,125 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2025-01-10 00:08:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:53,128 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-01-10 00:08:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:53,134 INFO L225 Difference]: With dead ends: 122 [2025-01-10 00:08:53,135 INFO L226 Difference]: Without dead ends: 120 [2025-01-10 00:08:53,138 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-01-10 00:08:53,141 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 71 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:53,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 102 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-10 00:08:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2025-01-10 00:08:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 98 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-01-10 00:08:53,181 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 3 [2025-01-10 00:08:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:53,181 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-01-10 00:08:53,182 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-01-10 00:08:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-01-10 00:08:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:08:53,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:53,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:08:53,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:08:53,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:53,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash 62627, now seen corresponding path program 1 times [2025-01-10 00:08:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:53,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931997617] [2025-01-10 00:08:53,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:53,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:08:53,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:08:53,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:53,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931997617] [2025-01-10 00:08:53,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931997617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:53,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:53,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:53,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260720408] [2025-01-10 00:08:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:53,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:53,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:53,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:53,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:53,456 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:53,545 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-01-10 00:08:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:53,545 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-01-10 00:08:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:53,546 INFO L225 Difference]: With dead ends: 100 [2025-01-10 00:08:53,547 INFO L226 Difference]: Without dead ends: 100 [2025-01-10 00:08:53,548 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-01-10 00:08:53,548 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 10 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:53,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 159 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-10 00:08:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-10 00:08:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.7457627118644068) internal successors, (103), 97 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-01-10 00:08:53,558 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 3 [2025-01-10 00:08:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:53,559 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-01-10 00:08:53,559 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-01-10 00:08:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-01-10 00:08:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:08:53,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:53,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:08:53,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:08:53,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:53,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1865700424, now seen corresponding path program 1 times [2025-01-10 00:08:53,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828025857] [2025-01-10 00:08:53,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:53,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:08:53,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:08:53,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:53,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:53,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:53,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828025857] [2025-01-10 00:08:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828025857] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115169216] [2025-01-10 00:08:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:53,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:53,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:53,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:53,729 INFO L87 Difference]: Start difference. First operand 100 states and 105 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-01-10 00:08:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:53,750 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2025-01-10 00:08:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:53,751 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-01-10 00:08:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:53,753 INFO L225 Difference]: With dead ends: 103 [2025-01-10 00:08:53,754 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 00:08:53,754 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-01-10 00:08:53,755 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 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-01-10 00:08:53,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:08:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 00:08:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-01-10 00:08:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.7333333333333334) internal successors, (104), 98 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-01-10 00:08:53,766 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 6 [2025-01-10 00:08:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:53,767 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-01-10 00:08:53,767 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-01-10 00:08:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-01-10 00:08:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:08:53,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:53,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:08:53,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:08:53,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:53,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1865700233, now seen corresponding path program 1 times [2025-01-10 00:08:53,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:53,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606589189] [2025-01-10 00:08:53,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:53,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:08:53,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:08:53,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:53,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:54,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606589189] [2025-01-10 00:08:54,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606589189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:54,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:54,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339353625] [2025-01-10 00:08:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:54,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:08:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:54,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:08:54,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:08:54,114 INFO L87 Difference]: Start difference. First operand 101 states and 106 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-01-10 00:08:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:54,221 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2025-01-10 00:08:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:08:54,222 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-01-10 00:08:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:54,225 INFO L225 Difference]: With dead ends: 103 [2025-01-10 00:08:54,226 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 00:08:54,227 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-01-10 00:08:54,227 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 11 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:54,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 00:08:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-01-10 00:08:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.721311475409836) internal successors, (105), 99 states have internal predecessors, (105), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2025-01-10 00:08:54,238 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 6 [2025-01-10 00:08:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:54,238 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2025-01-10 00:08:54,238 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-01-10 00:08:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2025-01-10 00:08:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:08:54,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:54,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:54,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:08:54,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:54,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -96149078, now seen corresponding path program 1 times [2025-01-10 00:08:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:54,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970368726] [2025-01-10 00:08:54,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:54,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:54,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:54,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:54,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:54,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970368726] [2025-01-10 00:08:54,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970368726] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107819836] [2025-01-10 00:08:54,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:54,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:54,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:54,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:08:54,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:08:54,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:54,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:54,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:54,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:54,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:08:54,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:54,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:54,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107819836] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:54,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:54,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:08:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124450830] [2025-01-10 00:08:54,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:54,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:08:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:54,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:08:54,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:54,784 INFO L87 Difference]: Start difference. First operand 102 states and 107 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-01-10 00:08:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:54,821 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2025-01-10 00:08:54,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:54,822 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-01-10 00:08:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:54,823 INFO L225 Difference]: With dead ends: 110 [2025-01-10 00:08:54,823 INFO L226 Difference]: Without dead ends: 110 [2025-01-10 00:08:54,823 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-01-10 00:08:54,824 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 4 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 395 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-01-10 00:08:54,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 395 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:08:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-10 00:08:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-10 00:08:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.6666666666666667) internal successors, (115), 107 states have internal predecessors, (115), 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-01-10 00:08:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2025-01-10 00:08:54,836 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 9 [2025-01-10 00:08:54,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:54,837 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2025-01-10 00:08:54,837 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-01-10 00:08:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2025-01-10 00:08:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:08:54,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:54,837 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:54,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:08:55,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:55,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash -96149269, now seen corresponding path program 1 times [2025-01-10 00:08:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524765886] [2025-01-10 00:08:55,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:55,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:55,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:55,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:55,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:55,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:55,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524765886] [2025-01-10 00:08:55,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524765886] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:55,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881070453] [2025-01-10 00:08:55,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:55,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:55,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:55,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:08:55,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:08:55,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:55,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:55,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:55,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:55,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:08:55,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:55,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:55,754 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-01-10 00:08:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881070453] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:55,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:08:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255031864] [2025-01-10 00:08:55,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:55,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:08:55,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:55,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:08:55,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:08:55,768 INFO L87 Difference]: Start difference. First operand 110 states and 117 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-01-10 00:08:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:56,020 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2025-01-10 00:08:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:08:56,020 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-01-10 00:08:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:56,021 INFO L225 Difference]: With dead ends: 108 [2025-01-10 00:08:56,021 INFO L226 Difference]: Without dead ends: 108 [2025-01-10 00:08:56,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-01-10 00:08:56,022 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 174 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:56,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 476 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:08:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-10 00:08:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-10 00:08:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 69 states have (on average 1.608695652173913) internal successors, (111), 105 states have internal predecessors, (111), 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-01-10 00:08:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2025-01-10 00:08:56,027 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 9 [2025-01-10 00:08:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:56,027 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2025-01-10 00:08:56,027 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-01-10 00:08:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2025-01-10 00:08:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:08:56,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:56,028 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:56,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:08:56,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:56,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:56,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:56,229 INFO L85 PathProgramCache]: Analyzing trace with hash 27958728, now seen corresponding path program 2 times [2025-01-10 00:08:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292303034] [2025-01-10 00:08:56,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:08:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:56,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 00:08:56,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 00:08:56,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:08:56,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 00:08:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292303034] [2025-01-10 00:08:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292303034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:56,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625260007] [2025-01-10 00:08:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:56,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:08:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:56,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:08:56,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:08:56,565 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-01-10 00:08:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:56,644 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2025-01-10 00:08:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-01-10 00:08:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:56,645 INFO L225 Difference]: With dead ends: 126 [2025-01-10 00:08:56,645 INFO L226 Difference]: Without dead ends: 126 [2025-01-10 00:08:56,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-10 00:08:56,646 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 136 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:56,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 93 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-10 00:08:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2025-01-10 00:08:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 104 states have internal predecessors, (110), 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-01-10 00:08:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2025-01-10 00:08:56,656 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 18 [2025-01-10 00:08:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:56,656 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2025-01-10 00:08:56,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-01-10 00:08:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2025-01-10 00:08:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:08:56,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:56,657 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:56,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:08:56,657 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:56,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash 27958729, now seen corresponding path program 1 times [2025-01-10 00:08:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:56,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327156495] [2025-01-10 00:08:56,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:56,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:56,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:08:56,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:08:56,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:56,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:56,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327156495] [2025-01-10 00:08:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327156495] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:56,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349901927] [2025-01-10 00:08:56,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:56,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:56,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:56,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:08:56,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:08:57,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:08:57,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:08:57,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:57,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:57,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:08:57,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:57,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349901927] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:57,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 00:08:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009449605] [2025-01-10 00:08:57,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:57,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:08:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:57,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:08:57,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:08:57,253 INFO L87 Difference]: Start difference. First operand 107 states and 112 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-01-10 00:08:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:57,315 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2025-01-10 00:08:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:08:57,317 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-01-10 00:08:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:57,318 INFO L225 Difference]: With dead ends: 125 [2025-01-10 00:08:57,318 INFO L226 Difference]: Without dead ends: 125 [2025-01-10 00:08:57,318 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-01-10 00:08:57,318 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:57,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 291 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-10 00:08:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-01-10 00:08:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 87 states have (on average 1.471264367816092) internal successors, (128), 122 states have internal predecessors, (128), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2025-01-10 00:08:57,328 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 18 [2025-01-10 00:08:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:57,328 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2025-01-10 00:08:57,328 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-01-10 00:08:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2025-01-10 00:08:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:08:57,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:57,329 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:57,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:08:57,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:57,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:57,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash 494523401, now seen corresponding path program 2 times [2025-01-10 00:08:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175252746] [2025-01-10 00:08:57,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:08:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:57,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 00:08:57,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-10 00:08:57,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:08:57,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:57,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175252746] [2025-01-10 00:08:57,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175252746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:57,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:57,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:57,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304997481] [2025-01-10 00:08:57,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:57,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:08:57,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:57,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:08:57,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:08:57,850 INFO L87 Difference]: Start difference. First operand 125 states and 130 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-01-10 00:08:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:57,973 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2025-01-10 00:08:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:57,973 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-01-10 00:08:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:57,974 INFO L225 Difference]: With dead ends: 143 [2025-01-10 00:08:57,975 INFO L226 Difference]: Without dead ends: 143 [2025-01-10 00:08:57,975 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-01-10 00:08:57,976 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 179 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:57,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 80 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-10 00:08:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2025-01-10 00:08:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 121 states have internal predecessors, (127), 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-01-10 00:08:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2025-01-10 00:08:57,981 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 36 [2025-01-10 00:08:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:57,981 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2025-01-10 00:08:57,981 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-01-10 00:08:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2025-01-10 00:08:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:08:57,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:57,982 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:57,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:08:57,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:57,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:57,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1694889529, now seen corresponding path program 1 times [2025-01-10 00:08:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:57,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495050956] [2025-01-10 00:08:57,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:58,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:08:58,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:08:58,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:58,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495050956] [2025-01-10 00:08:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495050956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:58,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207269043] [2025-01-10 00:08:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:58,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:58,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:58,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:58,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:58,306 INFO L87 Difference]: Start difference. First operand 124 states and 129 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-01-10 00:08:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:58,388 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2025-01-10 00:08:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:58,389 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-01-10 00:08:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:58,390 INFO L225 Difference]: With dead ends: 138 [2025-01-10 00:08:58,392 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 00:08:58,392 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-01-10 00:08:58,393 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 51 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:58,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 102 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 00:08:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2025-01-10 00:08:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 116 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2025-01-10 00:08:58,400 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 44 [2025-01-10 00:08:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:58,400 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2025-01-10 00:08:58,400 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-01-10 00:08:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2025-01-10 00:08:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:08:58,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:58,401 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:58,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:08:58,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1694889530, now seen corresponding path program 1 times [2025-01-10 00:08:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473518386] [2025-01-10 00:08:58,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:58,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:58,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:08:58,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:08:58,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:58,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:59,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473518386] [2025-01-10 00:08:59,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473518386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:08:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990206869] [2025-01-10 00:08:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:59,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:08:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:59,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:08:59,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:59,275 INFO L87 Difference]: Start difference. First operand 119 states and 124 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-01-10 00:08:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:59,360 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2025-01-10 00:08:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:08:59,361 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-01-10 00:08:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:59,362 INFO L225 Difference]: With dead ends: 137 [2025-01-10 00:08:59,362 INFO L226 Difference]: Without dead ends: 137 [2025-01-10 00:08:59,362 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-01-10 00:08:59,363 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 183 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 306 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-01-10 00:08:59,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 306 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-10 00:08:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2025-01-10 00:08:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 115 states have internal predecessors, (121), 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-01-10 00:08:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2025-01-10 00:08:59,369 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 44 [2025-01-10 00:08:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:59,369 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2025-01-10 00:08:59,369 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-01-10 00:08:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2025-01-10 00:08:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:08:59,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:59,372 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-01-10 00:08:59,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:08:59,372 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:59,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash 818456677, now seen corresponding path program 1 times [2025-01-10 00:08:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142171221] [2025-01-10 00:08:59,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:59,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:08:59,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:08:59,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:59,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:59,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142171221] [2025-01-10 00:08:59,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142171221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:59,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:59,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:59,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144381839] [2025-01-10 00:08:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:59,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:08:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:59,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:08:59,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:08:59,588 INFO L87 Difference]: Start difference. First operand 118 states and 123 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-01-10 00:08:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:59,694 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2025-01-10 00:08:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:08:59,695 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-01-10 00:08:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:59,696 INFO L225 Difference]: With dead ends: 136 [2025-01-10 00:08:59,696 INFO L226 Difference]: Without dead ends: 136 [2025-01-10 00:08:59,696 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-01-10 00:08:59,696 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:59,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 154 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-10 00:08:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2025-01-10 00:08:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 114 states have internal predecessors, (120), 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-01-10 00:08:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2025-01-10 00:08:59,701 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 47 [2025-01-10 00:08:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:59,702 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2025-01-10 00:08:59,702 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-01-10 00:08:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2025-01-10 00:08:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:08:59,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:59,703 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-01-10 00:08:59,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:08:59,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:08:59,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:59,704 INFO L85 PathProgramCache]: Analyzing trace with hash 818456678, now seen corresponding path program 1 times [2025-01-10 00:08:59,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:59,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100145780] [2025-01-10 00:08:59,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:59,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:59,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:08:59,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:08:59,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:59,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:00,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:00,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100145780] [2025-01-10 00:09:00,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100145780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:00,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:00,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:09:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944178107] [2025-01-10 00:09:00,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:00,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:00,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:00,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:00,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:00,036 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:00,102 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2025-01-10 00:09:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:09:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:00,104 INFO L225 Difference]: With dead ends: 136 [2025-01-10 00:09:00,104 INFO L226 Difference]: Without dead ends: 136 [2025-01-10 00:09:00,104 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-01-10 00:09:00,105 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 101 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:00,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 292 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:09:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-10 00:09:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2025-01-10 00:09:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 88 states have (on average 1.375) internal successors, (121), 115 states have internal predecessors, (121), 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-01-10 00:09:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2025-01-10 00:09:00,108 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 47 [2025-01-10 00:09:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:00,109 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2025-01-10 00:09:00,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2025-01-10 00:09:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:09:00,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:00,109 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-01-10 00:09:00,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:09:00,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:00,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash 818455590, now seen corresponding path program 1 times [2025-01-10 00:09:00,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:00,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866899718] [2025-01-10 00:09:00,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:00,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:09:00,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:09:00,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:00,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866899718] [2025-01-10 00:09:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866899718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:00,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:00,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:09:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659117785] [2025-01-10 00:09:00,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:00,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:09:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:00,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:09:00,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:00,521 INFO L87 Difference]: Start difference. First operand 118 states and 123 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-01-10 00:09:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:00,704 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2025-01-10 00:09:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:00,704 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-01-10 00:09:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:00,705 INFO L225 Difference]: With dead ends: 148 [2025-01-10 00:09:00,705 INFO L226 Difference]: Without dead ends: 148 [2025-01-10 00:09:00,705 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-01-10 00:09:00,706 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 156 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:00,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 190 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:09:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-10 00:09:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2025-01-10 00:09:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 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-01-10 00:09:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2025-01-10 00:09:00,710 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 47 [2025-01-10 00:09:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:00,710 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2025-01-10 00:09:00,710 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-01-10 00:09:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2025-01-10 00:09:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 00:09:00,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:00,713 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-01-10 00:09:00,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:09:00,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:00,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash 81149283, now seen corresponding path program 1 times [2025-01-10 00:09:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895590136] [2025-01-10 00:09:00,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:00,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:09:00,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:09:00,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:00,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:01,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:01,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895590136] [2025-01-10 00:09:01,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895590136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:01,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:01,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:09:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122294100] [2025-01-10 00:09:01,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:01,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:09:01,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:01,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:09:01,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:09:01,022 INFO L87 Difference]: Start difference. First operand 130 states and 142 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-01-10 00:09:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:01,095 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2025-01-10 00:09:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:09:01,096 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-01-10 00:09:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:01,098 INFO L225 Difference]: With dead ends: 138 [2025-01-10 00:09:01,098 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 00:09:01,100 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-01-10 00:09:01,100 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 43 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:01,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 98 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:09:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 00:09:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-01-10 00:09:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 134 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2025-01-10 00:09:01,107 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 50 [2025-01-10 00:09:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:01,107 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2025-01-10 00:09:01,107 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-01-10 00:09:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2025-01-10 00:09:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 00:09:01,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:01,108 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-01-10 00:09:01,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:09:01,108 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:01,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 81149284, now seen corresponding path program 1 times [2025-01-10 00:09:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913210619] [2025-01-10 00:09:01,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:01,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:09:01,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:09:01,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:01,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:01,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:01,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913210619] [2025-01-10 00:09:01,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913210619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:01,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:01,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:09:01,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586638070] [2025-01-10 00:09:01,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:01,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:09:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:01,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:09:01,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:09:01,862 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-01-10 00:09:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:02,061 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2025-01-10 00:09:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:09:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-01-10 00:09:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:02,062 INFO L225 Difference]: With dead ends: 147 [2025-01-10 00:09:02,064 INFO L226 Difference]: Without dead ends: 147 [2025-01-10 00:09:02,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:09:02,065 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 90 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:02,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 182 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:09:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-10 00:09:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2025-01-10 00:09:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 134 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2025-01-10 00:09:02,073 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 50 [2025-01-10 00:09:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:02,073 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2025-01-10 00:09:02,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-01-10 00:09:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2025-01-10 00:09:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 00:09:02,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:02,073 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-01-10 00:09:02,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:09:02,074 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:02,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash -548254067, now seen corresponding path program 1 times [2025-01-10 00:09:02,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:02,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872258407] [2025-01-10 00:09:02,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:02,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 00:09:02,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 00:09:02,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:02,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:02,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:02,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872258407] [2025-01-10 00:09:02,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872258407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:02,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:02,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:09:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183237948] [2025-01-10 00:09:02,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:02,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:09:02,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:02,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:09:02,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:09:02,807 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:02,973 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-01-10 00:09:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:02,974 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-01-10 00:09:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:02,975 INFO L225 Difference]: With dead ends: 136 [2025-01-10 00:09:02,975 INFO L226 Difference]: Without dead ends: 136 [2025-01-10 00:09:02,975 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-01-10 00:09:02,975 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:02,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 282 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:09:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-10 00:09:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-10 00:09:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 133 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-01-10 00:09:02,980 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 53 [2025-01-10 00:09:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:02,980 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-01-10 00:09:02,980 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-01-10 00:09:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-01-10 00:09:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 00:09:02,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:02,981 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-01-10 00:09:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:09:02,981 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -548254068, now seen corresponding path program 1 times [2025-01-10 00:09:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153362519] [2025-01-10 00:09:02,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:03,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 00:09:03,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 00:09:03,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:03,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:03,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:03,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153362519] [2025-01-10 00:09:03,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153362519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:03,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:03,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:09:03,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44349954] [2025-01-10 00:09:03,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:03,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:09:03,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:03,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:09:03,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:09:03,500 INFO L87 Difference]: Start difference. First operand 136 states and 148 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-01-10 00:09:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:03,646 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2025-01-10 00:09:03,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:03,646 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-01-10 00:09:03,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:03,647 INFO L225 Difference]: With dead ends: 135 [2025-01-10 00:09:03,647 INFO L226 Difference]: Without dead ends: 135 [2025-01-10 00:09:03,648 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-01-10 00:09:03,648 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 50 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:03,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 213 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:09:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-10 00:09:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-01-10 00:09:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 132 states have internal predecessors, (144), 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-01-10 00:09:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2025-01-10 00:09:03,655 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 53 [2025-01-10 00:09:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:03,655 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2025-01-10 00:09:03,655 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-01-10 00:09:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2025-01-10 00:09:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 00:09:03,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:03,656 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:03,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:09:03,656 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:03,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash 961041372, now seen corresponding path program 1 times [2025-01-10 00:09:03,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:03,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516537250] [2025-01-10 00:09:03,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:03,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 00:09:03,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 00:09:03,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:03,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:03,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516537250] [2025-01-10 00:09:03,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516537250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:03,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:09:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383302261] [2025-01-10 00:09:03,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:03,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:09:03,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:03,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:09:03,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:09:03,804 INFO L87 Difference]: Start difference. First operand 135 states and 146 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-01-10 00:09:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:03,819 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2025-01-10 00:09:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:09:03,822 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-01-10 00:09:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:03,824 INFO L225 Difference]: With dead ends: 147 [2025-01-10 00:09:03,824 INFO L226 Difference]: Without dead ends: 147 [2025-01-10 00:09:03,824 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-01-10 00:09:03,825 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 169 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-01-10 00:09:03,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:09:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-10 00:09:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2025-01-10 00:09:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 134 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2025-01-10 00:09:03,834 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 57 [2025-01-10 00:09:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:03,834 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2025-01-10 00:09:03,834 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-01-10 00:09:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2025-01-10 00:09:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 00:09:03,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:03,835 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-01-10 00:09:03,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:09:03,835 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:03,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -272797271, now seen corresponding path program 1 times [2025-01-10 00:09:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805808231] [2025-01-10 00:09:03,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:03,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 00:09:03,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 00:09:03,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:03,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:04,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805808231] [2025-01-10 00:09:04,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805808231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:04,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:09:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669136223] [2025-01-10 00:09:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:04,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:09:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:04,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:09:04,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:09:04,498 INFO L87 Difference]: Start difference. First operand 137 states and 148 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-01-10 00:09:04,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:04,769 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2025-01-10 00:09:04,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:09:04,770 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-01-10 00:09:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:04,771 INFO L225 Difference]: With dead ends: 150 [2025-01-10 00:09:04,772 INFO L226 Difference]: Without dead ends: 150 [2025-01-10 00:09:04,772 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-01-10 00:09:04,773 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 81 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:04,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 315 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:09:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-10 00:09:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2025-01-10 00:09:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 140 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2025-01-10 00:09:04,785 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 58 [2025-01-10 00:09:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:04,785 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2025-01-10 00:09:04,785 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-01-10 00:09:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2025-01-10 00:09:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 00:09:04,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:04,786 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-01-10 00:09:04,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:09:04,786 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:04,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:04,786 INFO L85 PathProgramCache]: Analyzing trace with hash -272797270, now seen corresponding path program 1 times [2025-01-10 00:09:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065365437] [2025-01-10 00:09:04,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:04,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:04,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 00:09:04,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 00:09:04,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:04,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:05,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:05,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065365437] [2025-01-10 00:09:05,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065365437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:05,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:05,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:09:05,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185815951] [2025-01-10 00:09:05,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:05,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:09:05,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:05,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:09:05,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:09:05,874 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:06,273 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2025-01-10 00:09:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:09:06,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-01-10 00:09:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:06,275 INFO L225 Difference]: With dead ends: 149 [2025-01-10 00:09:06,275 INFO L226 Difference]: Without dead ends: 149 [2025-01-10 00:09:06,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:09:06,276 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 80 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:06,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 387 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 00:09:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-10 00:09:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2025-01-10 00:09:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 140 states have internal predecessors, (153), 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-01-10 00:09:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2025-01-10 00:09:06,285 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 58 [2025-01-10 00:09:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:06,285 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2025-01-10 00:09:06,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2025-01-10 00:09:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 00:09:06,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:06,288 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, 1, 1, 1, 1] [2025-01-10 00:09:06,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:09:06,289 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:06,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:06,290 INFO L85 PathProgramCache]: Analyzing trace with hash 185079021, now seen corresponding path program 1 times [2025-01-10 00:09:06,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:06,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357370131] [2025-01-10 00:09:06,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:06,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:06,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 00:09:06,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:09:06,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:06,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357370131] [2025-01-10 00:09:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357370131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:09:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175780762] [2025-01-10 00:09:06,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:06,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:06,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:09:06,498 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:09:06,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:09:06,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 00:09:06,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:09:06,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:06,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:06,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:09:06,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:06,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175780762] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:09:06,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:09:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:09:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552242528] [2025-01-10 00:09:06,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:09:06,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:09:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:06,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:09:06,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:09:06,958 INFO L87 Difference]: Start difference. First operand 143 states and 155 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-01-10 00:09:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:06,994 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2025-01-10 00:09:06,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:06,995 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-01-10 00:09:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:06,999 INFO L225 Difference]: With dead ends: 172 [2025-01-10 00:09:06,999 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 00:09:06,999 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-01-10 00:09:07,001 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 17 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:07,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 339 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:09:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 00:09:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2025-01-10 00:09:07,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 141 states have (on average 1.326241134751773) internal successors, (187), 164 states have internal predecessors, (187), 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-01-10 00:09:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2025-01-10 00:09:07,007 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 62 [2025-01-10 00:09:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:07,007 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2025-01-10 00:09:07,007 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-01-10 00:09:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2025-01-10 00:09:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 00:09:07,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:07,008 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-01-10 00:09:07,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:09:07,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-10 00:09:07,209 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:07,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:07,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1442173624, now seen corresponding path program 1 times [2025-01-10 00:09:07,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:07,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100079506] [2025-01-10 00:09:07,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:07,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:09:07,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:09:07,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:07,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:07,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100079506] [2025-01-10 00:09:07,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100079506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:09:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291535322] [2025-01-10 00:09:07,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:07,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:07,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:09:07,976 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:09:07,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:09:08,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:09:08,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:09:08,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:08,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:08,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 00:09:08,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:08,375 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-01-10 00:09:08,415 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 00:09:08,415 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-01-10 00:09:08,462 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-01-10 00:09:08,524 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-01-10 00:09:08,632 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:08,632 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-01-10 00:09:08,707 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:08,708 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-01-10 00:09:08,739 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-01-10 00:09:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 00:09:08,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:08,845 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2025-01-10 00:09:08,914 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (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~mem143#1.base| v_ArrVal_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:09:08,983 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-01-10 00:09:09,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:09,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-01-10 00:09:09,009 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-01-10 00:09:09,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 180 [2025-01-10 00:09:09,051 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 107 treesize of output 71 [2025-01-10 00:09:09,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 120 [2025-01-10 00:09:09,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:09,872 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-01-10 00:09:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2025-01-10 00:09:10,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291535322] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:09:10,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:09:10,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2025-01-10 00:09:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936159481] [2025-01-10 00:09:10,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:09:10,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 00:09:10,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:10,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 00:09:10,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=339, Unknown=8, NotChecked=120, Total=552 [2025-01-10 00:09:10,418 INFO L87 Difference]: Start difference. First operand 167 states and 189 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-01-10 00:09:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:11,056 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2025-01-10 00:09:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:09:11,056 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-01-10 00:09:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:11,057 INFO L225 Difference]: With dead ends: 172 [2025-01-10 00:09:11,058 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 00:09:11,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=395, Unknown=8, NotChecked=132, Total=650 [2025-01-10 00:09:11,059 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 67 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:11,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 686 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 541 Invalid, 0 Unknown, 273 Unchecked, 0.5s Time] [2025-01-10 00:09:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 00:09:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2025-01-10 00:09:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 163 states have internal predecessors, (181), 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-01-10 00:09:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 183 transitions. [2025-01-10 00:09:11,064 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 183 transitions. Word has length 63 [2025-01-10 00:09:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:11,064 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 183 transitions. [2025-01-10 00:09:11,065 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-01-10 00:09:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 183 transitions. [2025-01-10 00:09:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 00:09:11,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:11,065 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-01-10 00:09:11,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 00:09:11,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 00:09:11,266 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:11,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1442173625, now seen corresponding path program 1 times [2025-01-10 00:09:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423131478] [2025-01-10 00:09:11,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:11,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:09:11,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:09:11,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:11,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423131478] [2025-01-10 00:09:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423131478] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:09:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139416992] [2025-01-10 00:09:12,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:12,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:12,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:09:12,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:09:12,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:09:12,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:09:12,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:09:12,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:12,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 00:09:12,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:12,999 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-01-10 00:09:13,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:09:13,029 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-01-10 00:09:13,037 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-01-10 00:09:13,083 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-01-10 00:09:13,091 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-01-10 00:09:13,149 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-01-10 00:09:13,153 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-01-10 00:09:13,236 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:13,237 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-01-10 00:09:13,250 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-01-10 00:09:13,371 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:13,371 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-01-10 00:09:13,382 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-01-10 00:09:13,444 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-01-10 00:09:13,450 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-01-10 00:09:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:13,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:13,579 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_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2018 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))))) is different from false [2025-01-10 00:09:13,604 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_2018 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2019) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:09:13,626 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_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int))) (<= (+ 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2019) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2018 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2025-01-10 00:09:13,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2016))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2017) .cse0 v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2019) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2017) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2016) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2025-01-10 00:09:13,658 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_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2016))) (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_2017) .cse1 v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2019) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2017) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2016) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)))))) is different from false [2025-01-10 00:09:13,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int)) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2014))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2016))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2015) .cse0 v_ArrVal_2017) .cse1 v_ArrVal_2018) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2019) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int)) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2014))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2015) .cse5 v_ArrVal_2017) (select (select (store .cse6 .cse5 v_ArrVal_2016) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2018))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))))) is different from false [2025-01-10 00:09:13,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:13,732 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 209 treesize of output 210 [2025-01-10 00:09:13,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:13,742 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 197 treesize of output 126 [2025-01-10 00:09:13,750 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 10810 treesize of output 8914 [2025-01-10 00:09:13,803 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 3842 treesize of output 3722 [2025-01-10 00:09:13,822 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 368 treesize of output 272 [2025-01-10 00:09:13,827 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 272 treesize of output 236 [2025-01-10 00:09:13,831 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 236 treesize of output 224 [2025-01-10 00:09:13,841 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 132 treesize of output 96 [2025-01-10 00:09:13,850 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 96 treesize of output 90 [2025-01-10 00:09:13,855 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 182 treesize of output 170 [2025-01-10 00:09:13,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:13,920 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 106 treesize of output 107 [2025-01-10 00:09:13,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:13,930 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 94 treesize of output 71 [2025-01-10 00:09:13,934 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:09:13,937 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 101 treesize of output 61 [2025-01-10 00:09:13,940 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:09:13,941 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:09:13,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-01-10 00:09:14,061 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:09:14,062 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-01-10 00:09:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-01-10 00:09:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139416992] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:09:14,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:09:14,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2025-01-10 00:09:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631184315] [2025-01-10 00:09:14,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:09:14,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 00:09:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:14,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 00:09:14,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=563, Unknown=6, NotChecked=318, Total=992 [2025-01-10 00:09:14,075 INFO L87 Difference]: Start difference. First operand 166 states and 183 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:14,977 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2025-01-10 00:09:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:09:14,977 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-01-10 00:09:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:14,978 INFO L225 Difference]: With dead ends: 172 [2025-01-10 00:09:14,978 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 00:09:14,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=200, Invalid=874, Unknown=6, NotChecked=402, Total=1482 [2025-01-10 00:09:14,980 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 197 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 595 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:14,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 600 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 459 Invalid, 0 Unknown, 595 Unchecked, 0.4s Time] [2025-01-10 00:09:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 00:09:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2025-01-10 00:09:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 163 states have internal predecessors, (179), 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-01-10 00:09:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2025-01-10 00:09:14,984 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 63 [2025-01-10 00:09:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:14,985 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2025-01-10 00:09:14,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2025-01-10 00:09:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:09:14,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:14,986 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:14,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:09:15,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 00:09:15,190 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:15,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1301626102, now seen corresponding path program 2 times [2025-01-10 00:09:15,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:15,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969422027] [2025-01-10 00:09:15,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:09:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:15,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-01-10 00:09:15,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:09:15,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:09:15,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:16,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:16,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969422027] [2025-01-10 00:09:16,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969422027] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:09:16,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469050769] [2025-01-10 00:09:16,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:09:16,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:16,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:09:16,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:09:16,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:09:16,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-01-10 00:09:17,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:09:17,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:09:17,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:17,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-10 00:09:17,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:17,201 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-01-10 00:09:17,223 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:09:17,224 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-01-10 00:09:17,233 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-01-10 00:09:17,245 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-01-10 00:09:17,249 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-01-10 00:09:17,274 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-01-10 00:09:17,284 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-01-10 00:09:17,343 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:17,344 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-01-10 00:09:17,353 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-01-10 00:09:17,448 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:17,448 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-01-10 00:09:17,459 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-01-10 00:09:17,572 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:17,573 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-01-10 00:09:17,582 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-01-10 00:09:17,643 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-01-10 00:09:17,647 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-01-10 00:09:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:17,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:17,862 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_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2262) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2263) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2262 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2262) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2025-01-10 00:09:17,931 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_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (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~mem144#1.base| v_ArrVal_2260) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2261) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2262) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2261))) (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~mem144#1.base| v_ArrVal_2260) .cse1 v_ArrVal_2262) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2263) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:09:17,957 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_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2261))) (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_2260) .cse1 v_ArrVal_2262) |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_2263) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2260) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2261) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2262) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 2)))))) is different from false [2025-01-10 00:09:17,979 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_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2261))) (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_2260) .cse1 v_ArrVal_2262) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2263) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2260) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2261) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2262) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2)))))) is different from false [2025-01-10 00:09:17,999 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_2259 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2258))) (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~mem143#1.base| v_ArrVal_2259) .cse0 v_ArrVal_2260) (select (select (store .cse1 .cse0 v_ArrVal_2261) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2262))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2258))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2261))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2259) .cse3 v_ArrVal_2260) .cse4 v_ArrVal_2262) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2263) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-01-10 00:09:19,181 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_2259 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2257))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2258))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2256) .cse0 v_ArrVal_2259) .cse1 v_ArrVal_2260) (select (select (store .cse2 .cse1 v_ArrVal_2261) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2262))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2263 (Array Int Int)) (v_ArrVal_2262 (Array Int Int)) (v_ArrVal_2261 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2257))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2258))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2261))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2256) .cse5 v_ArrVal_2259) .cse6 v_ArrVal_2260) .cse7 v_ArrVal_2262) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2263) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-01-10 00:09:19,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:19,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 211 [2025-01-10 00:09:19,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:19,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 127 [2025-01-10 00:09:19,244 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 137098 treesize of output 116722 [2025-01-10 00:09:20,025 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 210227 treesize of output 205275 [2025-01-10 00:09:20,875 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 18173 treesize of output 16493 [2025-01-10 00:09:20,961 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 16493 treesize of output 14069 [2025-01-10 00:09:21,029 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 14069 treesize of output 13733 [2025-01-10 00:09:21,102 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 13733 treesize of output 13241 [2025-01-10 00:09:21,181 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 13241 treesize of output 11561 [2025-01-10 00:09:21,251 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 11561 treesize of output 10223 [2025-01-10 00:09:21,339 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 10223 treesize of output 9887 [2025-01-10 00:09:24,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:24,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 418 [2025-01-10 00:09:24,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:24,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 238 [2025-01-10 00:09:24,806 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:09:24,812 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 22474 treesize of output 15026 [2025-01-10 00:09:24,835 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:09:24,835 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:09:24,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-01-10 00:09:24,923 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:09:24,923 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-01-10 00:09:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 10 not checked. [2025-01-10 00:09:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469050769] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:09:24,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:09:24,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 34 [2025-01-10 00:09:24,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969823628] [2025-01-10 00:09:24,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:09:24,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 00:09:24,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:24,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 00:09:24,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=677, Unknown=18, NotChecked=354, Total=1190 [2025-01-10 00:09:24,934 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 35 states have internal predecessors, (79), 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-01-10 00:09:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:26,222 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2025-01-10 00:09:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 00:09:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 35 states have internal predecessors, (79), 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 68 [2025-01-10 00:09:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:26,224 INFO L225 Difference]: With dead ends: 188 [2025-01-10 00:09:26,224 INFO L226 Difference]: Without dead ends: 188 [2025-01-10 00:09:26,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=342, Invalid=1469, Unknown=19, NotChecked=522, Total=2352 [2025-01-10 00:09:26,225 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 247 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 15 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 705 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:26,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 712 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 638 Invalid, 7 Unknown, 705 Unchecked, 0.6s Time] [2025-01-10 00:09:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-10 00:09:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2025-01-10 00:09:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 157 states have (on average 1.2547770700636942) internal successors, (197), 179 states have internal predecessors, (197), 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-01-10 00:09:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 199 transitions. [2025-01-10 00:09:26,235 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 199 transitions. Word has length 68 [2025-01-10 00:09:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:26,236 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 199 transitions. [2025-01-10 00:09:26,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.323529411764706) internal successors, (79), 35 states have internal predecessors, (79), 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-01-10 00:09:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 199 transitions. [2025-01-10 00:09:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 00:09:26,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:26,237 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 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, 1, 1] [2025-01-10 00:09:26,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 00:09:26,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:26,441 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:26,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1253863140, now seen corresponding path program 2 times [2025-01-10 00:09:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:26,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906166559] [2025-01-10 00:09:26,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:09:26,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:26,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-10 00:09:26,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 00:09:26,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:09:26,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:26,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906166559] [2025-01-10 00:09:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906166559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:09:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409230903] [2025-01-10 00:09:26,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:09:26,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:26,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:09:26,757 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:09:26,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:09:26,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-10 00:09:27,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 00:09:27,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:09:27,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:27,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:09:27,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:27,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:27,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409230903] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:09:27,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:09:27,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 00:09:27,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738455241] [2025-01-10 00:09:27,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:09:27,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:09:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:27,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:09:27,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:09:27,242 INFO L87 Difference]: Start difference. First operand 182 states and 199 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-01-10 00:09:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:27,290 INFO L93 Difference]: Finished difference Result 235 states and 253 transitions. [2025-01-10 00:09:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:09:27,290 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-01-10 00:09:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:27,291 INFO L225 Difference]: With dead ends: 235 [2025-01-10 00:09:27,291 INFO L226 Difference]: Without dead ends: 235 [2025-01-10 00:09:27,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:09:27,292 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 33 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 349 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-01-10 00:09:27,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 349 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:09:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-10 00:09:27,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 226. [2025-01-10 00:09:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 201 states have (on average 1.2487562189054726) internal successors, (251), 223 states have internal predecessors, (251), 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-01-10 00:09:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 253 transitions. [2025-01-10 00:09:27,298 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 253 transitions. Word has length 77 [2025-01-10 00:09:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:27,299 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 253 transitions. [2025-01-10 00:09:27,299 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-01-10 00:09:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 253 transitions. [2025-01-10 00:09:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 00:09:27,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:27,300 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:27,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:09:27,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-10 00:09:27,500 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2025-01-10 00:09:27,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:27,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1084350471, now seen corresponding path program 3 times [2025-01-10 00:09:27,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:27,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699538811] [2025-01-10 00:09:27,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:09:27,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:27,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 11 equivalence classes. [2025-01-10 00:09:27,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 68 of 83 statements. [2025-01-10 00:09:27,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 00:09:27,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:30,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:30,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699538811] [2025-01-10 00:09:30,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699538811] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:09:30,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265635134] [2025-01-10 00:09:30,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:09:30,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:09:30,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:09:30,123 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:09:30,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:09:30,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 11 equivalence classes. [2025-01-10 00:09:34,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 68 of 83 statements. [2025-01-10 00:09:34,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 00:09:34,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:34,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-10 00:09:34,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:34,042 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-01-10 00:09:34,065 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:09:34,065 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-01-10 00:09:34,073 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-01-10 00:09:34,109 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-01-10 00:09:34,118 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-01-10 00:09:34,161 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-01-10 00:09:34,167 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-01-10 00:09:34,222 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:34,222 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-01-10 00:09:34,228 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-01-10 00:09:34,321 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:34,321 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-01-10 00:09:34,328 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-01-10 00:09:34,419 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:34,419 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-01-10 00:09:34,423 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-01-10 00:09:34,519 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:34,519 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-01-10 00:09:34,525 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-01-10 00:09:34,615 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:34,615 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-01-10 00:09:34,621 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-01-10 00:09:34,714 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:34,714 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-01-10 00:09:34,720 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-01-10 00:09:34,776 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-01-10 00:09:34,782 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-01-10 00:09:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:34,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:35,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2803))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2802) .cse0 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2802) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2))))) is different from false [2025-01-10 00:09:35,478 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2804 (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~mem144#1.base| v_ArrVal_2801))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2800) .cse0 v_ArrVal_2802) (select (select (store .cse1 .cse0 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2804))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2801))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2803))) (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~mem144#1.base| v_ArrVal_2800) .cse3 v_ArrVal_2802) .cse4 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-01-10 00:09:35,533 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2801))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2800) .cse1 v_ArrVal_2802) (select (select (store .cse2 .cse1 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2804))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 3))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2801))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2803))) (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_2800) .cse4 v_ArrVal_2802) .cse5 v_ArrVal_2804) |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_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-01-10 00:09:35,567 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2801))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2803))) (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_2800) .cse1 v_ArrVal_2802) .cse2 v_ArrVal_2804) |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_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2801))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2800) .cse6 v_ArrVal_2802) (select (select (store .cse7 .cse6 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2804))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2025-01-10 00:09:35,677 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2799))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2801))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2798) .cse0 v_ArrVal_2800) .cse1 v_ArrVal_2802) (select (select (store .cse2 .cse1 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2804))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2799))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2801))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2803))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2798) .cse5 v_ArrVal_2800) .cse6 v_ArrVal_2802) .cse7 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-01-10 00:09:36,215 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2799))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2801))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2803))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2798) .cse1 v_ArrVal_2800) .cse2 v_ArrVal_2802) .cse3 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2799))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2801))) (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_2798) .cse8 v_ArrVal_2800) .cse9 v_ArrVal_2802) (select (select (store .cse10 .cse9 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2804))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2025-01-10 00:09:36,275 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2799))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2801))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2803))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2798) .cse1 v_ArrVal_2800) .cse2 v_ArrVal_2802) .cse3 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 6) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2799))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2801))) (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_2798) .cse8 v_ArrVal_2800) .cse9 v_ArrVal_2802) (select (select (store .cse10 .cse9 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2804))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 5)))))) is different from false [2025-01-10 00:09:36,628 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2797))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2799))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2801))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2796) .cse0 v_ArrVal_2798) .cse1 v_ArrVal_2800) .cse2 v_ArrVal_2802) (select (select (store .cse3 .cse2 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2804))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2797))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2799))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2801))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2803))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 6 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2796) .cse7 v_ArrVal_2798) .cse8 v_ArrVal_2800) .cse9 v_ArrVal_2802) .cse10 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))) is different from false [2025-01-10 00:09:41,234 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2797))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2799))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2801))) (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_2796) .cse1 v_ArrVal_2798) .cse2 v_ArrVal_2800) .cse3 v_ArrVal_2802) (select (select (store .cse4 .cse3 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_2804))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2797))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_2799))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2801))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2803))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 6 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2796) .cse8 v_ArrVal_2798) .cse9 v_ArrVal_2800) .cse10 v_ArrVal_2802) .cse11 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))))))) is different from false [2025-01-10 00:09:41,525 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ 5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2797))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2799))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2801))) (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_2796) .cse1 v_ArrVal_2798) .cse2 v_ArrVal_2800) .cse3 v_ArrVal_2802) (select (select (store .cse4 .cse3 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_2804))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2797))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_2799))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2801))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2803))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ 6 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2796) .cse8 v_ArrVal_2798) .cse9 v_ArrVal_2800) .cse10 v_ArrVal_2802) .cse11 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))))))) is different from false [2025-01-10 00:09:46,050 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_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ 5 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2794))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2797))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2799))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2801))) (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_#t~mem143#1.base| v_ArrVal_2795) .cse0 v_ArrVal_2796) .cse1 v_ArrVal_2798) .cse2 v_ArrVal_2800) .cse3 v_ArrVal_2802) (select (select (store .cse4 .cse3 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_2804))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2794))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_2797))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_2799))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_2801))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_2803))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ 6 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2795) .cse9 v_ArrVal_2796) .cse10 v_ArrVal_2798) .cse11 v_ArrVal_2800) .cse12 v_ArrVal_2802) .cse13 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))))))) is different from false [2025-01-10 00:09:50,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2794))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_2797))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_2799))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_2801))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_2803))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2795) .cse1 v_ArrVal_2796) .cse2 v_ArrVal_2798) .cse3 v_ArrVal_2800) .cse4 v_ArrVal_2802) .cse5 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) 6) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2794))) (let ((.cse12 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse12 v_ArrVal_2797))) (let ((.cse13 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse13 v_ArrVal_2799))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_2801))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2795) .cse12 v_ArrVal_2796) .cse13 v_ArrVal_2798) .cse14 v_ArrVal_2800) .cse15 v_ArrVal_2802) (select (select (store .cse16 .cse15 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_2804))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) 5)))))) is different from false [2025-01-10 00:09:54,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2793))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse0 v_ArrVal_2794))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2797))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2799))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_2801))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2792) .cse0 v_ArrVal_2795) .cse1 v_ArrVal_2796) .cse2 v_ArrVal_2798) .cse3 v_ArrVal_2800) .cse4 v_ArrVal_2802) (select (select (store .cse5 .cse4 v_ArrVal_2803) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_2804))))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) 5))) (forall ((v_ArrVal_2803 (Array Int Int)) (v_ArrVal_2802 (Array Int Int)) (v_ArrVal_2801 (Array Int Int)) (v_ArrVal_2800 (Array Int Int)) (v_ArrVal_2799 (Array Int Int)) (v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2797 (Array Int Int)) (v_ArrVal_2796 (Array Int Int)) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int)) (v_ArrVal_2792 (Array Int Int)) (v_ArrVal_2805 (Array Int Int)) (v_ArrVal_2804 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2793))) (let ((.cse11 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse21 (store .cse22 .cse11 v_ArrVal_2794))) (let ((.cse12 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse20 (store .cse21 .cse12 v_ArrVal_2797))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_2799))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_2801))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_2803))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (<= (+ (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2792) .cse11 v_ArrVal_2795) .cse12 v_ArrVal_2796) .cse13 v_ArrVal_2798) .cse14 v_ArrVal_2800) .cse15 v_ArrVal_2802) .cse16 v_ArrVal_2804) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) 6) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_2805) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))))))))) is different from false [2025-01-10 00:09:55,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:55,043 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 1666 treesize of output 1667 [2025-01-10 00:09:55,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:55,110 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 1654 treesize of output 911 [2025-01-10 00:09:55,771 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 4693522862458 treesize of output 3940176883442